| Mathbox for Alan Sare |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > onfrALT | Structured version Visualization version GIF version | ||
| Description: The membership relation is foundational on the class of ordinal numbers. onfrALT 45626 is an alternate proof of onfr 6402. onfrALTVD 45967 is the Virtual Deduction proof from which onfrALT 45626 is derived. The Virtual Deduction proof mirrors the working proof of onfr 6402 which is the main part of the proof of Theorem 7.12 of the first edition of TakeutiZaring. The proof of the corresponding Proposition 7.12 of [TakeutiZaring] p. 38 (second edition) does not contain the working proof equivalent of onfrALTVD 45967. This theorem does not rely on the Axiom of Regularity. (Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| onfrALT | ⊢ E Fr On |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfepfr 5634 | . 2 ⊢ ( E Fr On ↔ ∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) | |
| 2 | simpr 490 | . . 3 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → 𝑎 ≠ ∅) | |
| 3 | n0 4299 | . . . 4 ⊢ (𝑎 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝑎) | |
| 4 | onfrALTlem1 45625 | . . . . . . 7 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ((𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) | |
| 5 | 4 | expd 421 | . . . . . 6 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑥 ∈ 𝑎 → ((𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅))) |
| 6 | onfrALTlem2 45623 | . . . . . . 7 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ((𝑥 ∈ 𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) | |
| 7 | 6 | expd 421 | . . . . . 6 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑥 ∈ 𝑎 → (¬ (𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅))) |
| 8 | pm2.61 194 | . . . . . 6 ⊢ (((𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → ((¬ (𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) | |
| 9 | 5, 7, 8 | syl6c 71 | . . . . 5 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) |
| 10 | 9 | exlimdv 1965 | . . . 4 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (∃𝑥 𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) |
| 11 | 3, 10 | biimtrid 245 | . . 3 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑎 ≠ ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) |
| 12 | 2, 11 | mpd 16 | . 2 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) |
| 13 | 1, 12 | mpgbir 1831 | 1 ⊢ E Fr On |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∃wex 1811 ≠ wne 2955 ∃wrex 3086 ⊆ wss 3895 ∩ cin 4089 ∅c0 4278 E cep 5549 Fr wfr 5600 Oncon0 6362 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-13 2401 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-tr 5212 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-ord 6365 df-on 6366 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |