| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cantnffval2 | Structured version Visualization version GIF version | ||
| Description: An alternate definition of df-cnf 9700 which relies on cantnf 9731. (Note that although the use of 𝑆 seems self-referential, one can use cantnfdm 9702 to eliminate it.) (Contributed by Mario Carneiro, 28-May-2015.) |
| Ref | Expression |
|---|---|
| cantnfs.s | ⊢ 𝑆 = dom (𝐴 CNF 𝐵) |
| cantnfs.a | ⊢ (𝜑 → 𝐴 ∈ On) |
| cantnfs.b | ⊢ (𝜑 → 𝐵 ∈ On) |
| oemapval.t | ⊢ 𝑇 = {〈𝑥, 𝑦〉 ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))} |
| Ref | Expression |
|---|---|
| cantnffval2 | ⊢ (𝜑 → (𝐴 CNF 𝐵) = ◡OrdIso(𝑇, 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cantnfs.s | . . . . 5 ⊢ 𝑆 = dom (𝐴 CNF 𝐵) | |
| 2 | cantnfs.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ On) | |
| 3 | cantnfs.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ On) | |
| 4 | oemapval.t | . . . . 5 ⊢ 𝑇 = {〈𝑥, 𝑦〉 ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))} | |
| 5 | 1, 2, 3, 4 | cantnf 9731 | . . . 4 ⊢ (𝜑 → (𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴 ↑o 𝐵))) |
| 6 | isof1o 7362 | . . . 4 ⊢ ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴 ↑o 𝐵)) → (𝐴 CNF 𝐵):𝑆⟶1-1onto(𝐴 ↑o 𝐵)) | |
| 7 | f1orel 6857 | . . . 4 ⊢ ((𝐴 CNF 𝐵):𝑆⟶1-1onto(𝐴 ↑o 𝐵) → Rel (𝐴 CNF 𝐵)) | |
| 8 | 5, 6, 7 | 3syl 19 | . . 3 ⊢ (𝜑 → Rel (𝐴 CNF 𝐵)) |
| 9 | dfrel2 6199 | . . 3 ⊢ (Rel (𝐴 CNF 𝐵) ↔ ◡◡(𝐴 CNF 𝐵) = (𝐴 CNF 𝐵)) | |
| 10 | 8, 9 | sylib 221 | . 2 ⊢ (𝜑 → ◡◡(𝐴 CNF 𝐵) = (𝐴 CNF 𝐵)) |
| 11 | oecl 8583 | . . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ↑o 𝐵) ∈ On) | |
| 12 | 2, 3, 11 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → (𝐴 ↑o 𝐵) ∈ On) |
| 13 | eloni 6398 | . . . . . 6 ⊢ ((𝐴 ↑o 𝐵) ∈ On → Ord (𝐴 ↑o 𝐵)) | |
| 14 | 12, 13 | syl 18 | . . . . 5 ⊢ (𝜑 → Ord (𝐴 ↑o 𝐵)) |
| 15 | isocnv 7369 | . . . . . 6 ⊢ ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴 ↑o 𝐵)) → ◡(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴 ↑o 𝐵), 𝑆)) | |
| 16 | 5, 15 | syl 18 | . . . . 5 ⊢ (𝜑 → ◡(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴 ↑o 𝐵), 𝑆)) |
| 17 | 1, 2, 3, 4 | oemapwe 9732 | . . . . . . 7 ⊢ (𝜑 → (𝑇 We 𝑆 ∧ dom OrdIso(𝑇, 𝑆) = (𝐴 ↑o 𝐵))) |
| 18 | 17 | simpld 500 | . . . . . 6 ⊢ (𝜑 → 𝑇 We 𝑆) |
| 19 | ovex 7484 | . . . . . . . . 9 ⊢ (𝐴 CNF 𝐵) ∈ V | |
| 20 | 19 | dmex 7955 | . . . . . . . 8 ⊢ dom (𝐴 CNF 𝐵) ∈ V |
| 21 | 1, 20 | eqeltri 2860 | . . . . . . 7 ⊢ 𝑆 ∈ V |
| 22 | exse 5618 | . . . . . . 7 ⊢ (𝑆 ∈ V → 𝑇 Se 𝑆) | |
| 23 | 21, 22 | ax-mp 5 | . . . . . 6 ⊢ 𝑇 Se 𝑆 |
| 24 | eqid 2763 | . . . . . . 7 ⊢ OrdIso(𝑇, 𝑆) = OrdIso(𝑇, 𝑆) | |
| 25 | 24 | oieu 9570 | . . . . . 6 ⊢ ((𝑇 We 𝑆 ∧ 𝑇 Se 𝑆) → ((Ord (𝐴 ↑o 𝐵) ∧ ◡(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴 ↑o 𝐵), 𝑆)) ↔ ((𝐴 ↑o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ ◡(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆)))) |
| 26 | 18, 23, 25 | sylancl 598 | . . . . 5 ⊢ (𝜑 → ((Ord (𝐴 ↑o 𝐵) ∧ ◡(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴 ↑o 𝐵), 𝑆)) ↔ ((𝐴 ↑o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ ◡(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆)))) |
| 27 | 14, 16, 26 | mpbi2and 725 | . . . 4 ⊢ (𝜑 → ((𝐴 ↑o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ ◡(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))) |
| 28 | 27 | simprd 501 | . . 3 ⊢ (𝜑 → ◡(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆)) |
| 29 | 28 | cnveqd 5865 | . 2 ⊢ (𝜑 → ◡◡(𝐴 CNF 𝐵) = ◡OrdIso(𝑇, 𝑆)) |
| 30 | 10, 29 | eqtr3d 2800 | 1 ⊢ (𝜑 → (𝐴 CNF 𝐵) = ◡OrdIso(𝑇, 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 Vcvv 3454 {copab 5173 E cep 5557 Se wse 5609 We wwe 5610 ◡ccnv 5657 dom cdm 5658 Rel wrel 5663 Ord word 6387 Oncon0 6388 ⟶1-1ontowf1o 6565 ‘cfv 6566 Isom wiso 6567 (class class class)co 7451 ↑o coe 8513 OrdIsocoi 9540 CNF ccnf 9699 |
| 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-int 4913 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-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-supp 8215 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-seqom 8496 df-1o 8514 df-2o 8515 df-oadd 8518 df-omul 8519 df-oexp 8520 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-fsupp 9392 df-oi 9541 df-cnf 9700 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |