| 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 9634 which relies on cantnf 9665. (Note that although the use of 𝑆 seems self-referential, one can use cantnfdm 9636 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 9665 | . . . 4 ⊢ (𝜑 → (𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴 ↑o 𝐵))) |
| 6 | isof1o 7327 | . . . 4 ⊢ ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴 ↑o 𝐵)) → (𝐴 CNF 𝐵):𝑆–1-1-onto→(𝐴 ↑o 𝐵)) | |
| 7 | f1orel 6827 | . . . 4 ⊢ ((𝐴 CNF 𝐵):𝑆–1-1-onto→(𝐴 ↑o 𝐵) → Rel (𝐴 CNF 𝐵)) | |
| 8 | 5, 6, 7 | 3syl 19 | . . 3 ⊢ (𝜑 → Rel (𝐴 CNF 𝐵)) |
| 9 | dfrel2 6189 | . . 3 ⊢ (Rel (𝐴 CNF 𝐵) ↔ ◡◡(𝐴 CNF 𝐵) = (𝐴 CNF 𝐵)) | |
| 10 | 8, 9 | sylib 221 | . 2 ⊢ (𝜑 → ◡◡(𝐴 CNF 𝐵) = (𝐴 CNF 𝐵)) |
| 11 | oecl 8524 | . . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ↑o 𝐵) ∈ On) | |
| 12 | 2, 3, 11 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → (𝐴 ↑o 𝐵) ∈ On) |
| 13 | eloni 6374 | . . . . . 6 ⊢ ((𝐴 ↑o 𝐵) ∈ On → Ord (𝐴 ↑o 𝐵)) | |
| 14 | 12, 13 | syl 18 | . . . . 5 ⊢ (𝜑 → Ord (𝐴 ↑o 𝐵)) |
| 15 | isocnv 7334 | . . . . . 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 9666 | . . . . . . 7 ⊢ (𝜑 → (𝑇 We 𝑆 ∧ dom OrdIso(𝑇, 𝑆) = (𝐴 ↑o 𝐵))) |
| 18 | 17 | simpld 500 | . . . . . 6 ⊢ (𝜑 → 𝑇 We 𝑆) |
| 19 | ovex 7449 | . . . . . . . . 9 ⊢ (𝐴 CNF 𝐵) ∈ V | |
| 20 | 19 | dmex 7908 | . . . . . . . 8 ⊢ dom (𝐴 CNF 𝐵) ∈ V |
| 21 | 1, 20 | eqeltri 2861 | . . . . . . 7 ⊢ 𝑆 ∈ V |
| 22 | exse 5623 | . . . . . . 7 ⊢ (𝑆 ∈ V → 𝑇 Se 𝑆) | |
| 23 | 21, 22 | ax-mp 5 | . . . . . 6 ⊢ 𝑇 Se 𝑆 |
| 24 | eqid 2765 | . . . . . . 7 ⊢ OrdIso(𝑇, 𝑆) = OrdIso(𝑇, 𝑆) | |
| 25 | 24 | oieu 9504 | . . . . . 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 5863 | . 2 ⊢ (𝜑 → ◡◡(𝐴 CNF 𝐵) = ◡OrdIso(𝑇, 𝑆)) |
| 30 | 10, 29 | eqtr3d 2802 | 1 ⊢ (𝜑 → (𝐴 CNF 𝐵) = ◡OrdIso(𝑇, 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ∃wrex 3091 Vcvv 3457 {copab 5175 E cep 5562 Se wse 5614 We wwe 5615 ◡ccnv 5662 dom cdm 5663 Rel wrel 5668 Ord word 6363 Oncon0 6364 –1-1-onto→wf1o 6539 ‘cfv 6540 Isom wiso 6541 (class class class)co 7416 ↑o coe 8454 OrdIsocoi 9474 CNF ccnf 9633 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 |
| 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 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-supp 8159 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-seqom 8437 df-1o 8455 df-2o 8456 df-oadd 8459 df-omul 8460 df-oexp 8461 df-er 8696 df-map 8828 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-fsupp 9325 df-oi 9475 df-cnf 9634 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |