Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ordtypelem1 | Structured version Visualization version GIF version |
Description: Lemma for ordtype 9221. (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 4462 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡})) | |
4 | 1, 2, 3 | syl2anc 583 | . 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 9200 | . . 3 ⊢ OrdIso(𝑅, 𝐴) = if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) |
10 | 5, 9 | eqtri 2766 | . 2 ⊢ 𝑂 = if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) |
11 | ordtypelem.5 | . . 3 ⊢ 𝑇 = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡} | |
12 | 11 | reseq2i 5877 | . 2 ⊢ (𝐹 ↾ 𝑇) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}) |
13 | 4, 10, 12 | 3eqtr4g 2804 | 1 ⊢ (𝜑 → 𝑂 = (𝐹 ↾ 𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1539 ∀wral 3063 ∃wrex 3064 {crab 3067 Vcvv 3422 ∅c0 4253 ifcif 4456 class class class wbr 5070 ↦ cmpt 5153 Se wse 5533 We wwe 5534 ran crn 5581 ↾ cres 5582 “ cima 5583 Oncon0 6251 ℩crio 7211 recscrecs 8172 OrdIsocoi 9198 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-xp 5586 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-iota 6376 df-fv 6426 df-riota 7212 df-ov 7258 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-oi 9199 |
This theorem is referenced by: ordtypelem4 9210 ordtypelem6 9212 ordtypelem7 9213 ordtypelem9 9215 |
Copyright terms: Public domain | W3C validator |