| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hartogslem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for hartogs 9520. (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 9518 | . . 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 7758 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V) | |
| 8 | 7 | pwexd 5348 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝒫 (𝐴 × 𝐴) ∈ V) |
| 9 | ssexg 5288 | . . . . 5 ⊢ ((dom 𝐹 ⊆ 𝒫 (𝐴 × 𝐴) ∧ 𝒫 (𝐴 × 𝐴) ∈ V) → dom 𝐹 ∈ V) | |
| 10 | 6, 8, 9 | sylancr 599 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → dom 𝐹 ∈ V) |
| 11 | funex 7222 | . . . 4 ⊢ ((Fun 𝐹 ∧ dom 𝐹 ∈ V) → 𝐹 ∈ V) | |
| 12 | 5, 10, 11 | sylancr 599 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐹 ∈ V) |
| 13 | rnexg 7903 | . . 3 ⊢ (𝐹 ∈ V → ran 𝐹 ∈ V) | |
| 14 | 12, 13 | syl 18 | . 2 ⊢ (𝐴 ∈ 𝑉 → ran 𝐹 ∈ V) |
| 15 | 4, 14 | eqeltrrd 2863 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ On ∣ 𝑥 ≼ 𝐴} ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∃wrex 3088 {crab 3414 Vcvv 3453 ∖ cdif 3899 ⊆ wss 3902 𝒫 cpw 4560 class class class wbr 5107 {copab 5171 I cid 5553 E cep 5558 We wwe 5611 × cxp 5657 dom cdm 5659 ran crn 5660 ↾ cres 5661 Oncon0 6361 Fun wfun 6531 ‘cfv 6537 ≼ cdom 8954 OrdIsocoi 9485 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7374 df-ov 7420 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-en 8957 df-dom 8958 df-oi 9486 |
| This theorem is used by: hartogs 9520 |
| Copyright terms: Public domain | W3C validator |