| 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 45291 is an alternate proof of onfr 6404. onfrALTVD 45632 is the Virtual Deduction proof from which onfrALT 45291 is derived. The Virtual Deduction proof mirrors the working proof of onfr 6404 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 45632. 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 5647 | . 2 ⊢ ( E Fr On ↔ ∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) | |
| 2 | simpr 490 | . . 3 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → 𝑎 ≠ ∅) | |
| 3 | n0 4307 | . . . 4 ⊢ (𝑎 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝑎) | |
| 4 | onfrALTlem1 45290 | . . . . . . 7 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ((𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) | |
| 5 | 4 | expd 421 | . . . . . 6 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑥 ∈ 𝑎 → ((𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅))) |
| 6 | onfrALTlem2 45288 | . . . . . . 7 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ((𝑥 ∈ 𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) | |
| 7 | 6 | expd 421 | . . . . . 6 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑥 ∈ 𝑎 → (¬ (𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅))) |
| 8 | pm2.61 194 | . . . . . 6 ⊢ (((𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → ((¬ (𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) | |
| 9 | 5, 7, 8 | syl6c 71 | . . . . 5 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) |
| 10 | 9 | exlimdv 1966 | . . . 4 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (∃𝑥 𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) |
| 11 | 3, 10 | biimtrid 245 | . . 3 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑎 ≠ ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)) |
| 12 | 2, 11 | mpd 16 | . 2 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) |
| 13 | 1, 12 | mpgbir 1832 | 1 ⊢ E Fr On |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∃wex 1812 ≠ wne 2960 ∃wrex 3091 ∩ cin 3905 ⊆ wss 3906 ∅c0 4286 E cep 5562 Fr wfr 5613 Oncon0 6364 |
| 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-13 2406 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-tr 5221 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-ord 6367 df-on 6368 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |