| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hartogslem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for hartogs 9568. (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 9566 | . . 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 7796 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V) | |
| 8 | 7 | pwexd 5346 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝒫 (𝐴 × 𝐴) ∈ V) |
| 9 | ssexg 5286 | . . . . 5 ⊢ ((dom 𝐹 ⊆ 𝒫 (𝐴 × 𝐴) ∧ 𝒫 (𝐴 × 𝐴) ∈ V) → dom 𝐹 ∈ V) | |
| 10 | 6, 8, 9 | sylancr 599 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → dom 𝐹 ∈ V) |
| 11 | funex 7251 | . . . 4 ⊢ ((Fun 𝐹 ∧ dom 𝐹 ∈ V) → 𝐹 ∈ V) | |
| 12 | 5, 10, 11 | sylancr 599 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐹 ∈ V) |
| 13 | rnexg 7941 | . . 3 ⊢ (𝐹 ∈ V → ran 𝐹 ∈ V) | |
| 14 | 12, 13 | syl 18 | . 2 ⊢ (𝐴 ∈ 𝑉 → ran 𝐹 ∈ V) |
| 15 | 4, 14 | eqeltrrd 2865 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ On ∣ 𝑥 ≼ 𝐴} ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 {crab 3416 Vcvv 3454 ⊆ wss 3900 ∖ cdif 4048 𝒫 cpw 4560 class class class wbr 5106 {copab 5171 I cid 5550 E cep 5555 We wwe 5608 × cxp 5654 dom cdm 5656 ran crn 5657 ↾ cres 5658 Oncon0 6383 Fun wfun 6555 ‘cfv 6561 ≼ cdom 9002 OrdIsocoi 9533 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-se 5610 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7403 df-ov 7449 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-en 9005 df-dom 9006 df-oi 9534 |
| This theorem is used by: hartogs 9568 |
| Copyright terms: Public domain | W3C validator |