Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ordtypelem1 | Structured version Visualization version GIF version |
Description: Lemma for ordtype 8984. (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 4469 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡})) | |
4 | 1, 2, 3 | syl2anc 584 | . 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 8963 | . . 3 ⊢ OrdIso(𝑅, 𝐴) = if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) |
10 | 5, 9 | eqtri 2841 | . 2 ⊢ 𝑂 = if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) |
11 | ordtypelem.5 | . . 3 ⊢ 𝑇 = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡} | |
12 | 11 | reseq2i 5843 | . 2 ⊢ (𝐹 ↾ 𝑇) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}) |
13 | 4, 10, 12 | 3eqtr4g 2878 | 1 ⊢ (𝜑 → 𝑂 = (𝐹 ↾ 𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1528 ∀wral 3135 ∃wrex 3136 {crab 3139 Vcvv 3492 ∅c0 4288 ifcif 4463 class class class wbr 5057 ↦ cmpt 5137 Se wse 5505 We wwe 5506 ran crn 5549 ↾ cres 5550 “ cima 5551 Oncon0 6184 ℩crio 7102 recscrecs 7996 OrdIsocoi 8961 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-mpt 5138 df-xp 5554 df-cnv 5556 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-iota 6307 df-fv 6356 df-riota 7103 df-wrecs 7936 df-recs 7997 df-oi 8962 |
This theorem is referenced by: ordtypelem4 8973 ordtypelem6 8975 ordtypelem7 8976 ordtypelem9 8978 |
Copyright terms: Public domain | W3C validator |