Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fpwwe2lem9 | Structured version Visualization version GIF version |
Description: Lemma for fpwwe2 10399. Given two well-orders 〈𝑋, 𝑅〉 and 〈𝑌, 𝑆〉 of parts of 𝐴, one is an initial segment of the other. (Contributed by Mario Carneiro, 15-May-2015.) (Revised by AV, 20-Jul-2024.) |
Ref | Expression |
---|---|
fpwwe2.1 | ⊢ 𝑊 = {〈𝑥, 𝑟〉 ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))} |
fpwwe2.2 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
fpwwe2.3 | ⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥𝐹𝑟) ∈ 𝐴) |
fpwwe2lem9.4 | ⊢ (𝜑 → 𝑋𝑊𝑅) |
fpwwe2lem9.6 | ⊢ (𝜑 → 𝑌𝑊𝑆) |
Ref | Expression |
---|---|
fpwwe2lem9 | ⊢ (𝜑 → ((𝑋 ⊆ 𝑌 ∧ 𝑅 = (𝑆 ∩ (𝑌 × 𝑋))) ∨ (𝑌 ⊆ 𝑋 ∧ 𝑆 = (𝑅 ∩ (𝑋 × 𝑌))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2738 | . . . 4 ⊢ OrdIso(𝑅, 𝑋) = OrdIso(𝑅, 𝑋) | |
2 | 1 | oicl 9288 | . . 3 ⊢ Ord dom OrdIso(𝑅, 𝑋) |
3 | eqid 2738 | . . . 4 ⊢ OrdIso(𝑆, 𝑌) = OrdIso(𝑆, 𝑌) | |
4 | 3 | oicl 9288 | . . 3 ⊢ Ord dom OrdIso(𝑆, 𝑌) |
5 | ordtri2or2 6362 | . . 3 ⊢ ((Ord dom OrdIso(𝑅, 𝑋) ∧ Ord dom OrdIso(𝑆, 𝑌)) → (dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌) ∨ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋))) | |
6 | 2, 4, 5 | mp2an 689 | . 2 ⊢ (dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌) ∨ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) |
7 | fpwwe2.1 | . . . . 5 ⊢ 𝑊 = {〈𝑥, 𝑟〉 ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))} | |
8 | fpwwe2.2 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
9 | 8 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) → 𝐴 ∈ 𝑉) |
10 | fpwwe2.3 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥𝐹𝑟) ∈ 𝐴) | |
11 | 10 | adantlr 712 | . . . . 5 ⊢ (((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥𝐹𝑟) ∈ 𝐴) |
12 | fpwwe2lem9.4 | . . . . . 6 ⊢ (𝜑 → 𝑋𝑊𝑅) | |
13 | 12 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) → 𝑋𝑊𝑅) |
14 | fpwwe2lem9.6 | . . . . . 6 ⊢ (𝜑 → 𝑌𝑊𝑆) | |
15 | 14 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) → 𝑌𝑊𝑆) |
16 | simpr 485 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) → dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) | |
17 | 7, 9, 11, 13, 15, 1, 3, 16 | fpwwe2lem8 10394 | . . . 4 ⊢ ((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) → (𝑋 ⊆ 𝑌 ∧ 𝑅 = (𝑆 ∩ (𝑌 × 𝑋)))) |
18 | 17 | ex 413 | . . 3 ⊢ (𝜑 → (dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌) → (𝑋 ⊆ 𝑌 ∧ 𝑅 = (𝑆 ∩ (𝑌 × 𝑋))))) |
19 | 8 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → 𝐴 ∈ 𝑉) |
20 | 10 | adantlr 712 | . . . . 5 ⊢ (((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥𝐹𝑟) ∈ 𝐴) |
21 | 14 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → 𝑌𝑊𝑆) |
22 | 12 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → 𝑋𝑊𝑅) |
23 | simpr 485 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) | |
24 | 7, 19, 20, 21, 22, 3, 1, 23 | fpwwe2lem8 10394 | . . . 4 ⊢ ((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → (𝑌 ⊆ 𝑋 ∧ 𝑆 = (𝑅 ∩ (𝑋 × 𝑌)))) |
25 | 24 | ex 413 | . . 3 ⊢ (𝜑 → (dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋) → (𝑌 ⊆ 𝑋 ∧ 𝑆 = (𝑅 ∩ (𝑋 × 𝑌))))) |
26 | 18, 25 | orim12d 962 | . 2 ⊢ (𝜑 → ((dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌) ∨ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → ((𝑋 ⊆ 𝑌 ∧ 𝑅 = (𝑆 ∩ (𝑌 × 𝑋))) ∨ (𝑌 ⊆ 𝑋 ∧ 𝑆 = (𝑅 ∩ (𝑋 × 𝑌)))))) |
27 | 6, 26 | mpi 20 | 1 ⊢ (𝜑 → ((𝑋 ⊆ 𝑌 ∧ 𝑅 = (𝑆 ∩ (𝑌 × 𝑋))) ∨ (𝑌 ⊆ 𝑋 ∧ 𝑆 = (𝑅 ∩ (𝑋 × 𝑌))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∨ wo 844 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ∀wral 3064 [wsbc 3716 ∩ cin 3886 ⊆ wss 3887 {csn 4561 class class class wbr 5074 {copab 5136 We wwe 5543 × cxp 5587 ◡ccnv 5588 dom cdm 5589 “ cima 5592 Ord word 6265 (class class class)co 7275 OrdIsocoi 9268 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-se 5545 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-isom 6442 df-riota 7232 df-ov 7278 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-oi 9269 |
This theorem is referenced by: fpwwe2lem10 10396 fpwwe2lem11 10397 fpwwe2 10399 |
Copyright terms: Public domain | W3C validator |