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

Theorem onfrALTVD 38947
Description: Virtual deduction proof of onfrALT 38584. 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 38584 is onfrALTVD 38947 without virtual deductions and was automatically derived from onfrALTVD 38947.
 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 38610 . . . . . 6 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   )
2 simpr 477 . . . . . 6 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → 𝑎 ≠ ∅)
31, 2e1a 38672 . . . . 5 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   𝑎 ≠ ∅   )
4 exmid 431 . . . . . . . . . 10 ((𝑎𝑥) = ∅ ∨ ¬ (𝑎𝑥) = ∅)
5 onfrALTlem1VD 38946 . . . . . . . . . . 11 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   (𝑥𝑎 ∧ (𝑎𝑥) = ∅)   ▶   𝑦𝑎 (𝑎𝑦) = ∅   )
65in2an 38653 . . . . . . . . . 10 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥𝑎   ▶   ((𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
7 onfrALTlem2VD 38945 . . . . . . . . . . 11 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   (𝑥𝑎 ∧ ¬ (𝑎𝑥) = ∅)   ▶   𝑦𝑎 (𝑎𝑦) = ∅   )
87in2an 38653 . . . . . . . . . 10 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥𝑎   ▶   (¬ (𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
9 pm2.61 183 . . . . . . . . . . 11 (((𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ((¬ (𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
109a1i 11 . . . . . . . . . 10 (((𝑎𝑥) = ∅ ∨ ¬ (𝑎𝑥) = ∅) → (((𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ((¬ (𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅)))
114, 6, 8, 10e022 38686 . . . . . . . . 9 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥𝑎   ▶   𝑦𝑎 (𝑎𝑦) = ∅   )
1211in2 38650 . . . . . . . 8 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
1312gen11 38661 . . . . . . 7 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   𝑥(𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
14 19.23v 1900 . . . . . . . 8 (∀𝑥(𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅) ↔ (∃𝑥 𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅))
1514biimpi 206 . . . . . . 7 (∀𝑥(𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅) → (∃𝑥 𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅))
1613, 15e1a 38672 . . . . . 6 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (∃𝑥 𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
17 n0 3923 . . . . . 6 (𝑎 ≠ ∅ ↔ ∃𝑥 𝑥𝑎)
18 imbi1 337 . . . . . . 7 ((𝑎 ≠ ∅ ↔ ∃𝑥 𝑥𝑎) → ((𝑎 ≠ ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) ↔ (∃𝑥 𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅)))
1918biimprcd 240 . . . . . 6 ((∃𝑥 𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ((𝑎 ≠ ∅ ↔ ∃𝑥 𝑥𝑎) → (𝑎 ≠ ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅)))
2016, 17, 19e10 38739 . . . . 5 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑎 ≠ ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅)   )
21 pm2.27 42 . . . . 5 (𝑎 ≠ ∅ → ((𝑎 ≠ ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
223, 20, 21e11 38733 . . . 4 (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   𝑦𝑎 (𝑎𝑦) = ∅   )
2322in1 38607 . . 3 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅)
2423ax-gen 1720 . 2 𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅)
25 dfepfr 5089 . . 3 ( E Fr On ↔ ∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
2625biimpri 218 . 2 (∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅) → E Fr On)
2724, 26e0a 38819 1 E Fr On
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∨ wo 383   ∧ wa 384  ∀wal 1479   = wceq 1481  ∃wex 1702   ∈ wcel 1988   ≠ wne 2791  ∃wrex 2910   ∩ cin 3566   ⊆ wss 3567  ∅c0 3907   E cep 5018   Fr wfr 5060  Oncon0 5711 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-sep 4772  ax-nul 4780  ax-pr 4897 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-fal 1487  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ne 2792  df-ral 2914  df-rex 2915  df-rab 2918  df-v 3197  df-sbc 3430  df-csb 3527  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-br 4645  df-opab 4704  df-tr 4744  df-eprel 5019  df-po 5025  df-so 5026  df-fr 5063  df-we 5065  df-ord 5714  df-on 5715  df-vd1 38606  df-vd2 38614  df-vd3 38626 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator