| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fpwwe2lem9 | Structured version Visualization version GIF version | ||
| Description: Lemma for fpwwe2 10767. 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 2763 | . . . 4 ⊢ OrdIso(𝑅, 𝑋) = OrdIso(𝑅, 𝑋) | |
| 2 | 1 | oicl 9560 | . . 3 ⊢ Ord dom OrdIso(𝑅, 𝑋) |
| 3 | eqid 2763 | . . . 4 ⊢ OrdIso(𝑆, 𝑌) = OrdIso(𝑆, 𝑌) | |
| 4 | 3 | oicl 9560 | . . 3 ⊢ Ord dom OrdIso(𝑆, 𝑌) |
| 5 | ordtri2or2 6490 | . . 3 ⊢ ((Ord dom OrdIso(𝑅, 𝑋) ∧ Ord dom OrdIso(𝑆, 𝑌)) → (dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌) ∨ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋))) | |
| 6 | 2, 4, 5 | mp2an 705 | . 2 ⊢ (dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌) ∨ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) |
| 7 | fpwwe2.1 | . . . . 5 ⊢ 𝑊 = {〈𝑥, 𝑟〉 ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))} | |
| 8 | fpwwe2.2 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 9 | 8 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) → 𝐴 ∈ 𝑉) |
| 10 | fpwwe2.3 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥𝐹𝑟) ∈ 𝐴) | |
| 11 | 10 | adantlr 728 | . . . . 5 ⊢ (((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥𝐹𝑟) ∈ 𝐴) |
| 12 | fpwwe2lem9.4 | . . . . . 6 ⊢ (𝜑 → 𝑋𝑊𝑅) | |
| 13 | 12 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) → 𝑋𝑊𝑅) |
| 14 | fpwwe2lem9.6 | . . . . . 6 ⊢ (𝜑 → 𝑌𝑊𝑆) | |
| 15 | 14 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) → 𝑌𝑊𝑆) |
| 16 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) → dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) | |
| 17 | 7, 9, 11, 13, 15, 1, 3, 16 | fpwwe2lem8 10762 | . . . 4 ⊢ ((𝜑 ∧ dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌)) → (𝑋 ⊆ 𝑌 ∧ 𝑅 = (𝑆 ∩ (𝑌 × 𝑋)))) |
| 18 | 17 | ex 418 | . . 3 ⊢ (𝜑 → (dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌) → (𝑋 ⊆ 𝑌 ∧ 𝑅 = (𝑆 ∩ (𝑌 × 𝑋))))) |
| 19 | 8 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → 𝐴 ∈ 𝑉) |
| 20 | 10 | adantlr 728 | . . . . 5 ⊢ (((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥𝐹𝑟) ∈ 𝐴) |
| 21 | 14 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → 𝑌𝑊𝑆) |
| 22 | 12 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → 𝑋𝑊𝑅) |
| 23 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) | |
| 24 | 7, 19, 20, 21, 22, 3, 1, 23 | fpwwe2lem8 10762 | . . . 4 ⊢ ((𝜑 ∧ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → (𝑌 ⊆ 𝑋 ∧ 𝑆 = (𝑅 ∩ (𝑋 × 𝑌)))) |
| 25 | 24 | ex 418 | . . 3 ⊢ (𝜑 → (dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋) → (𝑌 ⊆ 𝑋 ∧ 𝑆 = (𝑅 ∩ (𝑋 × 𝑌))))) |
| 26 | 18, 25 | orim12d 979 | . 2 ⊢ (𝜑 → ((dom OrdIso(𝑅, 𝑋) ⊆ dom OrdIso(𝑆, 𝑌) ∨ dom OrdIso(𝑆, 𝑌) ⊆ dom OrdIso(𝑅, 𝑋)) → ((𝑋 ⊆ 𝑌 ∧ 𝑅 = (𝑆 ∩ (𝑌 × 𝑋))) ∨ (𝑌 ⊆ 𝑋 ∧ 𝑆 = (𝑅 ∩ (𝑋 × 𝑌)))))) |
| 27 | 6, 26 | mpi 21 | 1 ⊢ (𝜑 → ((𝑋 ⊆ 𝑌 ∧ 𝑅 = (𝑆 ∩ (𝑌 × 𝑋))) ∨ (𝑌 ⊆ 𝑋 ∧ 𝑆 = (𝑅 ∩ (𝑋 × 𝑌))))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 [wsbc 3742 ⊆ wss 3900 ∩ cin 4092 {csn 4588 class class class wbr 5108 {copab 5173 We wwe 5610 × cxp 5656 ◡ccnv 5657 dom cdm 5658 “ cima 5661 Ord word 6387 (class class class)co 7451 OrdIsocoi 9540 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-oi 9541 |
| This theorem is used by: fpwwe2lem10 10764 fpwwe2lem11 10765 fpwwe2 10767 |
| Copyright terms: Public domain | W3C validator |