Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  onfrALTVD Structured version   Visualization version   GIF version

Theorem onfrALTVD 45657
Description: Virtual deduction proof of onfrALT 45316. 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. onfrALT 45316 is onfrALTVD 45657 without virtual deductions and was automatically derived from onfrALTVD 45657.
1:: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   (𝑥𝑎 ∧ ¬ (𝑎𝑥) = ∅)   ▶   𝑦𝑎(𝑎𝑦) = ∅   )
2:: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   (𝑥𝑎 ∧ (𝑎𝑥) = ∅)   ▶   𝑦𝑎(𝑎𝑦) = ∅   )
3:1: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥𝑎   ▶    (¬ (𝑎𝑥) = ∅ → ∃𝑦𝑎(𝑎𝑦) = ∅)   )
4:2: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥𝑎   ▶    ((𝑎𝑥) = ∅ → ∃𝑦𝑎(𝑎𝑦) = ∅)   )
5:: ((𝑎𝑥) = ∅ ∨ ¬ (𝑎𝑥) = ∅)
6:5,4,3: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥𝑎   ▶    𝑦𝑎(𝑎𝑦) = ∅   )
7:6: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑥𝑎 → ∃𝑦𝑎(𝑎𝑦) = ∅)   )
8:7: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   𝑥(𝑥 𝑎 → ∃𝑦𝑎(𝑎𝑦) = ∅)   )
9:8: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (∃𝑥𝑥 𝑎 → ∃𝑦𝑎(𝑎𝑦) = ∅)   )
10:: (𝑎 ≠ ∅ ↔ ∃𝑥𝑥𝑎)
11:9,10: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑎 ∅ → ∃𝑦𝑎(𝑎𝑦) = ∅)   )
12:: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑎 On ∧ 𝑎 ≠ ∅)   )
13:12: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   𝑎    )
14:13,11: (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   𝑦 𝑎(𝑎𝑦) = ∅   )
15:14: ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅)
16:15: 𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦 𝑎(𝑎𝑦) = ∅)
qed:16: E Fr On
(Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
onfrALTVD E Fr On

Proof of Theorem onfrALTVD
Dummy variables 𝑥 𝑎 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 idn1 45341 . . . . . 6 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   )
2 simpr 490 . . . . . 6 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → 𝑎 ≠ ∅)
31, 2e1a 45394 . . . . 5 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   𝑎 ≠ ∅   )
4 exmid 908 . . . . . . . . . 10 ((𝑎𝑥) = ∅ ∨ ¬ (𝑎𝑥) = ∅)
5 onfrALTlem1VD 45656 . . . . . . . . . . 11 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   (𝑥𝑎 ∧ (𝑎𝑥) = ∅)   ▶   𝑦𝑎 (𝑎𝑦) = ∅   )
65in2an 45375 . . . . . . . . . 10 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥𝑎   ▶   ((𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
7 onfrALTlem2VD 45655 . . . . . . . . . . 11 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   (𝑥𝑎 ∧ ¬ (𝑎𝑥) = ∅)   ▶   𝑦𝑎 (𝑎𝑦) = ∅   )
87in2an 45375 . . . . . . . . . 10 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥𝑎   ▶   (¬ (𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
9 pm2.61 194 . . . . . . . . . . 11 (((𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ((¬ (𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
109a1i 11 . . . . . . . . . 10 (((𝑎𝑥) = ∅ ∨ ¬ (𝑎𝑥) = ∅) → (((𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ((¬ (𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅)))
114, 6, 8, 10e022 45408 . . . . . . . . 9 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥𝑎   ▶   𝑦𝑎 (𝑎𝑦) = ∅   )
1211in2 45372 . . . . . . . 8 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
1312gen11 45383 . . . . . . 7 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   𝑥(𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
14 19.23v 1975 . . . . . . . 8 (∀𝑥(𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅) ↔ (∃𝑥 𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅))
1514biimpi 219 . . . . . . 7 (∀𝑥(𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅) → (∃𝑥 𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅))
1613, 15e1a 45394 . . . . . 6 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (∃𝑥 𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
17 n0 4307 . . . . . 6 (𝑎 ≠ ∅ ↔ ∃𝑥 𝑥𝑎)
18 imbi1 350 . . . . . . 7 ((𝑎 ≠ ∅ ↔ ∃𝑥 𝑥𝑎) → ((𝑎 ≠ ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) ↔ (∃𝑥 𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅)))
1918biimprcd 253 . . . . . 6 ((∃𝑥 𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ((𝑎 ≠ ∅ ↔ ∃𝑥 𝑥𝑎) → (𝑎 ≠ ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅)))
2016, 17, 19e10 45461 . . . . 5 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑎 ≠ ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
21 pm2.27 43 . . . . 5 (𝑎 ≠ ∅ → ((𝑎 ≠ ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
223, 20, 21e11 45455 . . . 4 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   𝑦𝑎 (𝑎𝑦) = ∅   )
2322in1 45338 . . 3 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅)
2423ax-gen 1828 . 2 𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅)
25 dfepfr 5647 . . 3 ( E Fr On ↔ ∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
2625biimpri 231 . 2 (∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅) → E Fr On)
2724, 26e0a 45538 1 E Fr On
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  wo 861  wal 1568   = wceq 1570  wex 1812  wcel 2146  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  df-vd1 45337  df-vd2 45345  df-vd3 45357
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator