| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hartogslem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for hartogs 9516. (Contributed by Mario Carneiro, 14-Jan-2013.) |
| Ref | Expression |
|---|---|
| hartogslem.2 | ⊢ 𝐹 = {〈𝑟, 𝑦〉 ∣ (((dom 𝑟 ⊆ 𝐴 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} |
| hartogslem.3 | ⊢ 𝑅 = {〈𝑠, 𝑡〉 ∣ ∃𝑤 ∈ 𝑦 ∃𝑧 ∈ 𝑦 ((𝑠 = (𝑓‘𝑤) ∧ 𝑡 = (𝑓‘𝑧)) ∧ 𝑤 E 𝑧)} |
| Ref | Expression |
|---|---|
| hartogslem2 | ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ On ∣ 𝑥 ≼ 𝐴} ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hartogslem.2 | . . . 4 ⊢ 𝐹 = {〈𝑟, 𝑦〉 ∣ (((dom 𝑟 ⊆ 𝐴 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} | |
| 2 | hartogslem.3 | . . . 4 ⊢ 𝑅 = {〈𝑠, 𝑡〉 ∣ ∃𝑤 ∈ 𝑦 ∃𝑧 ∈ 𝑦 ((𝑠 = (𝑓‘𝑤) ∧ 𝑡 = (𝑓‘𝑧)) ∧ 𝑤 E 𝑧)} | |
| 3 | 1, 2 | hartogslem1 9514 | . . 3 ⊢ (dom 𝐹 ⊆ 𝒫 (𝐴 × 𝐴) ∧ Fun 𝐹 ∧ (𝐴 ∈ 𝑉 → ran 𝐹 = {𝑥 ∈ On ∣ 𝑥 ≼ 𝐴})) |
| 4 | 3 | simp3i 1159 | . 2 ⊢ (𝐴 ∈ 𝑉 → ran 𝐹 = {𝑥 ∈ On ∣ 𝑥 ≼ 𝐴}) |
| 5 | 3 | simp2i 1158 | . . . 4 ⊢ Fun 𝐹 |
| 6 | 3 | simp1i 1157 | . . . . 5 ⊢ dom 𝐹 ⊆ 𝒫 (𝐴 × 𝐴) |
| 7 | sqxpexg 7763 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V) | |
| 8 | 7 | pwexd 5355 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝒫 (𝐴 × 𝐴) ∈ V) |
| 9 | ssexg 5295 | . . . . 5 ⊢ ((dom 𝐹 ⊆ 𝒫 (𝐴 × 𝐴) ∧ 𝒫 (𝐴 × 𝐴) ∈ V) → dom 𝐹 ∈ V) | |
| 10 | 6, 8, 9 | sylancr 599 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → dom 𝐹 ∈ V) |
| 11 | funex 7224 | . . . 4 ⊢ ((Fun 𝐹 ∧ dom 𝐹 ∈ V) → 𝐹 ∈ V) | |
| 12 | 5, 10, 11 | sylancr 599 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐹 ∈ V) |
| 13 | rnexg 7908 | . . 3 ⊢ (𝐹 ∈ V → ran 𝐹 ∈ V) | |
| 14 | 12, 13 | syl 18 | . 2 ⊢ (𝐴 ∈ 𝑉 → ran 𝐹 ∈ V) |
| 15 | 4, 14 | eqeltrrd 2867 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ On ∣ 𝑥 ≼ 𝐴} ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∃wrex 3092 {crab 3419 Vcvv 3458 ∖ cdif 3905 ⊆ wss 3908 𝒫 cpw 4567 class class class wbr 5114 {copab 5178 I cid 5560 E cep 5565 We wwe 5618 × cxp 5664 dom cdm 5666 ran crn 5667 ↾ cres 5668 Oncon0 6367 Fun wfun 6537 ‘cfv 6543 ≼ cdom 8950 OrdIsocoi 9481 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-se 5620 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7380 df-ov 7426 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-en 8953 df-dom 8954 df-oi 9482 |
| This theorem is used by: hartogs 9516 |
| Copyright terms: Public domain | W3C validator |