![]() |
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 2732 | . . . . 5 ⊢ recs((ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))) = recs((ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))) | |
2 | eqid 2732 | . . . . 5 ⊢ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} | |
3 | eqid 2732 | . . . . 5 ⊢ (ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)) = (ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)) | |
4 | 1, 2, 3 | ordtypecbv 9511 | . . . 4 ⊢ recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) = recs((ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))) |
5 | eqid 2732 | . . . 4 ⊢ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) “ 𝑥)𝑧𝑅𝑡} = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) “ 𝑥)𝑧𝑅𝑡} | |
6 | oicl.1 | . . . 4 ⊢ 𝐹 = OrdIso(𝑅, 𝐴) | |
7 | simpl 483 | . . . 4 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 We 𝐴) | |
8 | simpr 485 | . . . 4 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Se 𝐴) | |
9 | 4, 2, 3, 5, 6, 7, 8 | ordtypelem5 9516 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (Ord dom 𝐹 ∧ 𝐹:dom 𝐹⟶𝐴)) |
10 | 9 | simprd 496 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹:dom 𝐹⟶𝐴) |
11 | f0 6772 | . . 3 ⊢ ∅:∅⟶𝐴 | |
12 | 6 | oi0 9522 | . . . 4 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹 = ∅) |
13 | 12 | dmeqd 5905 | . . . . 5 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → dom 𝐹 = dom ∅) |
14 | dm0 5920 | . . . . 5 ⊢ dom ∅ = ∅ | |
15 | 13, 14 | eqtrdi 2788 | . . . 4 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → dom 𝐹 = ∅) |
16 | 12, 15 | feq12d 6705 | . . 3 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (𝐹:dom 𝐹⟶𝐴 ↔ ∅:∅⟶𝐴)) |
17 | 11, 16 | mpbiri 257 | . 2 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹:dom 𝐹⟶𝐴) |
18 | 10, 17 | pm2.61i 182 | 1 ⊢ 𝐹:dom 𝐹⟶𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 396 = wceq 1541 ∀wral 3061 ∃wrex 3070 {crab 3432 Vcvv 3474 ∅c0 4322 class class class wbr 5148 ↦ cmpt 5231 Se wse 5629 We wwe 5630 dom cdm 5676 ran crn 5677 “ cima 5679 Ord word 6363 Oncon0 6364 ⟶wf 6539 ℩crio 7363 recscrecs 8369 OrdIsocoi 9503 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 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 2703 ax-sep 5299 ax-nul 5306 ax-pr 5427 ax-un 7724 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-oi 9504 |
This theorem is referenced by: oismo 9534 cantnfle 9665 cantnflt 9666 cantnfres 9671 cantnfp1lem3 9674 cantnflem1b 9680 cantnflem1 9683 wemapwe 9691 cnfcomlem 9693 cnfcom 9694 cnfcom3lem 9697 cnfcom3 9698 hsmexlem1 10420 hsmexlem2 10421 fpwwe2lem7 10631 |
Copyright terms: Public domain | W3C validator |