Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > r1ord3g | Structured version Visualization version GIF version |
Description: Ordering relation for the cumulative hierarchy of sets. Part of Theorem 3.3(i) of [BellMachover] p. 478. (Contributed by NM, 22-Sep-2003.) |
Ref | Expression |
---|---|
r1ord3g | ⊢ ((𝐴 ∈ dom 𝑅1 ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ⊆ 𝐵 → (𝑅1‘𝐴) ⊆ (𝑅1‘𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | r1funlim 9280 | . . . . . 6 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
2 | 1 | simpri 489 | . . . . 5 ⊢ Lim dom 𝑅1 |
3 | limord 6241 | . . . . 5 ⊢ (Lim dom 𝑅1 → Ord dom 𝑅1) | |
4 | ordsson 7535 | . . . . 5 ⊢ (Ord dom 𝑅1 → dom 𝑅1 ⊆ On) | |
5 | 2, 3, 4 | mp2b 10 | . . . 4 ⊢ dom 𝑅1 ⊆ On |
6 | 5 | sseli 3883 | . . 3 ⊢ (𝐴 ∈ dom 𝑅1 → 𝐴 ∈ On) |
7 | 5 | sseli 3883 | . . 3 ⊢ (𝐵 ∈ dom 𝑅1 → 𝐵 ∈ On) |
8 | onsseleq 6223 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
9 | 6, 7, 8 | syl2an 599 | . 2 ⊢ ((𝐴 ∈ dom 𝑅1 ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
10 | r1tr 9290 | . . . 4 ⊢ Tr (𝑅1‘𝐵) | |
11 | r1ordg 9292 | . . . . 5 ⊢ (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ 𝐵 → (𝑅1‘𝐴) ∈ (𝑅1‘𝐵))) | |
12 | 11 | adantl 485 | . . . 4 ⊢ ((𝐴 ∈ dom 𝑅1 ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ 𝐵 → (𝑅1‘𝐴) ∈ (𝑅1‘𝐵))) |
13 | trss 5155 | . . . 4 ⊢ (Tr (𝑅1‘𝐵) → ((𝑅1‘𝐴) ∈ (𝑅1‘𝐵) → (𝑅1‘𝐴) ⊆ (𝑅1‘𝐵))) | |
14 | 10, 12, 13 | mpsylsyld 69 | . . 3 ⊢ ((𝐴 ∈ dom 𝑅1 ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ 𝐵 → (𝑅1‘𝐴) ⊆ (𝑅1‘𝐵))) |
15 | fveq2 6686 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝑅1‘𝐴) = (𝑅1‘𝐵)) | |
16 | eqimss 3943 | . . . . 5 ⊢ ((𝑅1‘𝐴) = (𝑅1‘𝐵) → (𝑅1‘𝐴) ⊆ (𝑅1‘𝐵)) | |
17 | 15, 16 | syl 17 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑅1‘𝐴) ⊆ (𝑅1‘𝐵)) |
18 | 17 | a1i 11 | . . 3 ⊢ ((𝐴 ∈ dom 𝑅1 ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 = 𝐵 → (𝑅1‘𝐴) ⊆ (𝑅1‘𝐵))) |
19 | 14, 18 | jaod 858 | . 2 ⊢ ((𝐴 ∈ dom 𝑅1 ∧ 𝐵 ∈ dom 𝑅1) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) → (𝑅1‘𝐴) ⊆ (𝑅1‘𝐵))) |
20 | 9, 19 | sylbid 243 | 1 ⊢ ((𝐴 ∈ dom 𝑅1 ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ⊆ 𝐵 → (𝑅1‘𝐴) ⊆ (𝑅1‘𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∨ wo 846 = wceq 1542 ∈ wcel 2114 ⊆ wss 3853 Tr wtr 5146 dom cdm 5535 Ord word 6181 Oncon0 6182 Lim wlim 6183 Fun wfun 6343 ‘cfv 6349 𝑅1cr1 9276 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2711 ax-sep 5177 ax-nul 5184 ax-pow 5242 ax-pr 5306 ax-un 7491 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2541 df-eu 2571 df-clab 2718 df-cleq 2731 df-clel 2812 df-nfc 2882 df-ne 2936 df-ral 3059 df-rex 3060 df-reu 3061 df-rab 3063 df-v 3402 df-sbc 3686 df-csb 3801 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-pss 3872 df-nul 4222 df-if 4425 df-pw 4500 df-sn 4527 df-pr 4529 df-tp 4531 df-op 4533 df-uni 4807 df-iun 4893 df-br 5041 df-opab 5103 df-mpt 5121 df-tr 5147 df-id 5439 df-eprel 5444 df-po 5452 df-so 5453 df-fr 5493 df-we 5495 df-xp 5541 df-rel 5542 df-cnv 5543 df-co 5544 df-dm 5545 df-rn 5546 df-res 5547 df-ima 5548 df-pred 6139 df-ord 6185 df-on 6186 df-lim 6187 df-suc 6188 df-iota 6307 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-om 7612 df-wrecs 7988 df-recs 8049 df-rdg 8087 df-r1 9278 |
This theorem is referenced by: r1ord3 9296 r1val1 9300 rankr1ag 9316 unwf 9324 rankelb 9338 rankonidlem 9342 |
Copyright terms: Public domain | W3C validator |