Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ordtypelem1 | Structured version Visualization version GIF version |
Description: Lemma for ordtype 8990. (Contributed by Mario Carneiro, 24-Jun-2015.) |
Ref | Expression |
---|---|
ordtypelem.1 | ⊢ 𝐹 = recs(𝐺) |
ordtypelem.2 | ⊢ 𝐶 = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} |
ordtypelem.3 | ⊢ 𝐺 = (ℎ ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣)) |
ordtypelem.5 | ⊢ 𝑇 = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡} |
ordtypelem.6 | ⊢ 𝑂 = OrdIso(𝑅, 𝐴) |
ordtypelem.7 | ⊢ (𝜑 → 𝑅 We 𝐴) |
ordtypelem.8 | ⊢ (𝜑 → 𝑅 Se 𝐴) |
Ref | Expression |
---|---|
ordtypelem1 | ⊢ (𝜑 → 𝑂 = (𝐹 ↾ 𝑇)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ordtypelem.7 | . . 3 ⊢ (𝜑 → 𝑅 We 𝐴) | |
2 | ordtypelem.8 | . . 3 ⊢ (𝜑 → 𝑅 Se 𝐴) | |
3 | iftrue 4473 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡})) | |
4 | 1, 2, 3 | syl2anc 586 | . 2 ⊢ (𝜑 → if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡})) |
5 | ordtypelem.6 | . . 3 ⊢ 𝑂 = OrdIso(𝑅, 𝐴) | |
6 | ordtypelem.2 | . . . 4 ⊢ 𝐶 = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} | |
7 | ordtypelem.3 | . . . 4 ⊢ 𝐺 = (ℎ ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣)) | |
8 | ordtypelem.1 | . . . 4 ⊢ 𝐹 = recs(𝐺) | |
9 | 6, 7, 8 | dfoi 8969 | . . 3 ⊢ OrdIso(𝑅, 𝐴) = if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) |
10 | 5, 9 | eqtri 2844 | . 2 ⊢ 𝑂 = if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) |
11 | ordtypelem.5 | . . 3 ⊢ 𝑇 = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡} | |
12 | 11 | reseq2i 5845 | . 2 ⊢ (𝐹 ↾ 𝑇) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}) |
13 | 4, 10, 12 | 3eqtr4g 2881 | 1 ⊢ (𝜑 → 𝑂 = (𝐹 ↾ 𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1533 ∀wral 3138 ∃wrex 3139 {crab 3142 Vcvv 3495 ∅c0 4291 ifcif 4467 class class class wbr 5059 ↦ cmpt 5139 Se wse 5507 We wwe 5508 ran crn 5551 ↾ cres 5552 “ cima 5553 Oncon0 6186 ℩crio 7107 recscrecs 8001 OrdIsocoi 8967 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-opab 5122 df-mpt 5140 df-xp 5556 df-cnv 5558 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-iota 6309 df-fv 6358 df-riota 7108 df-wrecs 7941 df-recs 8002 df-oi 8968 |
This theorem is referenced by: ordtypelem4 8979 ordtypelem6 8981 ordtypelem7 8982 ordtypelem9 8984 |
Copyright terms: Public domain | W3C validator |