Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ordtypelem1 | Structured version Visualization version GIF version |
Description: Lemma for ordtype 8320. (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 4042 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡})) | |
4 | 1, 2, 3 | syl2anc 691 | . 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 8299 | . . 3 ⊢ OrdIso(𝑅, 𝐴) = if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) |
10 | 5, 9 | eqtri 2632 | . 2 ⊢ 𝑂 = if((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}), ∅) |
11 | ordtypelem.5 | . . 3 ⊢ 𝑇 = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡} | |
12 | 11 | reseq2i 5314 | . 2 ⊢ (𝐹 ↾ 𝑇) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}) |
13 | 4, 10, 12 | 3eqtr4g 2669 | 1 ⊢ (𝜑 → 𝑂 = (𝐹 ↾ 𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 = wceq 1475 ∀wral 2896 ∃wrex 2897 {crab 2900 Vcvv 3173 ∅c0 3874 ifcif 4036 class class class wbr 4583 ↦ cmpt 4643 Se wse 4995 We wwe 4996 ran crn 5039 ↾ cres 5040 “ cima 5041 Oncon0 5640 ℩crio 6510 recscrecs 7354 OrdIsocoi 8297 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-xp 5044 df-cnv 5046 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-iota 5768 df-fv 5812 df-riota 6511 df-wrecs 7294 df-recs 7355 df-oi 8298 |
This theorem is referenced by: ordtypelem4 8309 ordtypelem6 8311 ordtypelem7 8312 ordtypelem9 8314 |
Copyright terms: Public domain | W3C validator |