![]() |
Mathbox for Alan Sare |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > onfrALTlem1VD | Structured version Visualization version GIF version |
Description: Virtual deduction proof of onfrALTlem1 43612.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
onfrALTlem1 43612 is onfrALTlem1VD 43954 without virtual deductions and was
automatically derived from onfrALTlem1VD 43954.
|
Ref | Expression |
---|---|
onfrALTlem1VD | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅ ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | idn2 43677 | . . . . 5 ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ▶ (𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ) | |
2 | 19.8a 2173 | . . . . 5 ⊢ ((𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) → ∃𝑥(𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅)) | |
3 | 1, 2 | e2 43695 | . . . 4 ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑥(𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ) |
4 | cbvexsv 43611 | . . . . 5 ⊢ (∃𝑥(𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ↔ ∃𝑦[𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅)) | |
5 | 4 | biimpi 215 | . . . 4 ⊢ (∃𝑥(𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) → ∃𝑦[𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅)) |
6 | 3, 5 | e2 43695 | . . 3 ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦[𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ) |
7 | sbsbc 3781 | . . . . . 6 ⊢ ([𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ↔ [𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅)) | |
8 | onfrALTlem4 43607 | . . . . . 6 ⊢ ([𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ↔ (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅)) | |
9 | 7, 8 | bitri 275 | . . . . 5 ⊢ ([𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ↔ (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅)) |
10 | 9 | ax-gen 1796 | . . . 4 ⊢ ∀𝑦([𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ↔ (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅)) |
11 | exbi 1848 | . . . 4 ⊢ (∀𝑦([𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ↔ (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅)) → (∃𝑦[𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ↔ ∃𝑦(𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅))) | |
12 | 10, 11 | e0a 43836 | . . 3 ⊢ (∃𝑦[𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ↔ ∃𝑦(𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅)) |
13 | 6, 12 | e2bi 43696 | . 2 ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦(𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅) ) |
14 | df-rex 3070 | . 2 ⊢ (∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅ ↔ ∃𝑦(𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅)) | |
15 | 13, 14 | e2bir 43697 | 1 ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅ ) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 ∀wal 1538 = wceq 1540 ∃wex 1780 [wsb 2066 ∈ wcel 2105 ≠ wne 2939 ∃wrex 3069 [wsbc 3777 ∩ cin 3947 ⊆ wss 3948 ∅c0 4322 Oncon0 6364 ( wvd2 43641 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-13 2370 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-in 3955 df-nul 4323 df-vd2 43642 |
This theorem is referenced by: onfrALTVD 43955 |
Copyright terms: Public domain | W3C validator |