Metamath Proof Explorer


Theorem oldss

Description: If A is less than or equal to ordinal B , then the old set of A is included in the made set of B . (Contributed by Scott Fenton, 9-Oct-2024)

Ref Expression
Assertion oldss ⊢ B ∈ On ∧ A ⊆ B → Old ⁡ A ⊆ Old ⁡ B

Proof

Step Hyp Ref Expression
1 imass2 ⊢ A ⊆ B → M A ⊆ M B
2 1 unissd ⊢ A ⊆ B → ⋃ M A ⊆ ⋃ M B
3 2 adantl ⊢ A ∈ On ∧ B ∈ On ∧ A ⊆ B → ⋃ M A ⊆ ⋃ M B
4 oldval ⊢ A ∈ On → Old ⁡ A = ⋃ M A
5 4 adantr ⊢ A ∈ On ∧ B ∈ On → Old ⁡ A = ⋃ M A
6 5 adantr ⊢ A ∈ On ∧ B ∈ On ∧ A ⊆ B → Old ⁡ A = ⋃ M A
7 oldval ⊢ B ∈ On → Old ⁡ B = ⋃ M B
8 7 adantl ⊢ A ∈ On ∧ B ∈ On → Old ⁡ B = ⋃ M B
9 8 adantr ⊢ A ∈ On ∧ B ∈ On ∧ A ⊆ B → Old ⁡ B = ⋃ M B
10 3 6 9 3sstr4d ⊢ A ∈ On ∧ B ∈ On ∧ A ⊆ B → Old ⁡ A ⊆ Old ⁡ B
11 10 expl ⊢ A ∈ On → B ∈ On ∧ A ⊆ B → Old ⁡ A ⊆ Old ⁡ B
12 oldf ⊢ Old : On ⟶ 𝒫 No
13 12 fdmi ⊢ dom ⁡ Old = On
14 13 eleq2i ⊢ A ∈ dom ⁡ Old ↔ A ∈ On
15 ndmfv ⊢ ¬ A ∈ dom ⁡ Old → Old ⁡ A = ∅
16 14 15 sylnbir ⊢ ¬ A ∈ On → Old ⁡ A = ∅
17 0ss ⊢ ∅ ⊆ Old ⁡ B
18 16 17 eqsstrdi ⊢ ¬ A ∈ On → Old ⁡ A ⊆ Old ⁡ B
19 18 a1d ⊢ ¬ A ∈ On → B ∈ On ∧ A ⊆ B → Old ⁡ A ⊆ Old ⁡ B
20 11 19 pm2.61i ⊢ B ∈ On ∧ A ⊆ B → Old ⁡ A ⊆ Old ⁡ B