| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > oif | Structured version Visualization version GIF version | ||
| Description: The order isomorphism of the well-order 𝑅 on 𝐴 is a function. (Contributed by Mario Carneiro, 23-May-2015.) |
| Ref | Expression |
|---|---|
| oicl.1 | ⊢ 𝐹 = OrdIso(𝑅, 𝐴) |
| Ref | Expression |
|---|---|
| oif | ⊢ 𝐹:dom 𝐹⟶𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2731 | . . . . 5 ⊢ recs((ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))) = recs((ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))) | |
| 2 | eqid 2731 | . . . . 5 ⊢ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} | |
| 3 | eqid 2731 | . . . . 5 ⊢ (ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)) = (ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)) | |
| 4 | 1, 2, 3 | ordtypecbv 9398 | . . . 4 ⊢ recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) = recs((ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))) |
| 5 | eqid 2731 | . . . 4 ⊢ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) “ 𝑥)𝑧𝑅𝑡} = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) “ 𝑥)𝑧𝑅𝑡} | |
| 6 | oicl.1 | . . . 4 ⊢ 𝐹 = OrdIso(𝑅, 𝐴) | |
| 7 | simpl 482 | . . . 4 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 We 𝐴) | |
| 8 | simpr 484 | . . . 4 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Se 𝐴) | |
| 9 | 4, 2, 3, 5, 6, 7, 8 | ordtypelem5 9403 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (Ord dom 𝐹 ∧ 𝐹:dom 𝐹⟶𝐴)) |
| 10 | 9 | simprd 495 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹:dom 𝐹⟶𝐴) |
| 11 | f0 6699 | . . 3 ⊢ ∅:∅⟶𝐴 | |
| 12 | 6 | oi0 9409 | . . . 4 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹 = ∅) |
| 13 | 12 | dmeqd 5840 | . . . . 5 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → dom 𝐹 = dom ∅) |
| 14 | dm0 5855 | . . . . 5 ⊢ dom ∅ = ∅ | |
| 15 | 13, 14 | eqtrdi 2782 | . . . 4 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → dom 𝐹 = ∅) |
| 16 | 12, 15 | feq12d 6634 | . . 3 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (𝐹:dom 𝐹⟶𝐴 ↔ ∅:∅⟶𝐴)) |
| 17 | 11, 16 | mpbiri 258 | . 2 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹:dom 𝐹⟶𝐴) |
| 18 | 10, 17 | pm2.61i 182 | 1 ⊢ 𝐹:dom 𝐹⟶𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∧ wa 395 = wceq 1541 ∀wral 3047 ∃wrex 3056 {crab 3395 Vcvv 3436 ∅c0 4278 class class class wbr 5086 ↦ cmpt 5167 Se wse 5562 We wwe 5563 dom cdm 5611 ran crn 5612 “ cima 5614 Ord word 6300 Oncon0 6301 ⟶wf 6472 ℩crio 7297 recscrecs 8285 OrdIsocoi 9390 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5229 ax-nul 5239 ax-pr 5365 ax-un 7663 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4279 df-if 4471 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-iun 4938 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5506 df-eprel 5511 df-po 5519 df-so 5520 df-fr 5564 df-se 5565 df-we 5566 df-xp 5617 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 df-pred 6243 df-ord 6304 df-on 6305 df-lim 6306 df-suc 6307 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-riota 7298 df-ov 7344 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-oi 9391 |
| This theorem is referenced by: oismo 9421 cantnfle 9556 cantnflt 9557 cantnfres 9562 cantnfp1lem3 9565 cantnflem1b 9571 cantnflem1 9574 wemapwe 9582 cnfcomlem 9584 cnfcom 9585 cnfcom3lem 9588 cnfcom3 9589 hsmexlem1 10312 hsmexlem2 10313 fpwwe2lem7 10523 |
| Copyright terms: Public domain | W3C validator |