Theorem onfrALTVD 45335

Description: Virtual deduction proof of onfrALT 44994. 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 44994 is onfrALTVD 45335 without virtual deductions and was automatically derived from onfrALTVD 45335.

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.

Step	Hyp	Ref	Expression
1		idn1 45019	. . . . . 6 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   )
2		simpr 484	. . . . . 6 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → 𝑎 ≠ ∅)
3	1, 2	e1a 45072	. . . . 5 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   𝑎 ≠ ∅   )
4		exmid 895	. . . . . . . . . 10 ⊢ ((𝑎 ∩ 𝑥) = ∅ ∨ ¬ (𝑎 ∩ 𝑥) = ∅)
5		onfrALTlem1VD 45334	. . . . . . . . . . 11 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   (𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅)   ▶   ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅   )
6	5	in2an 45053	. . . . . . . . . 10 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥 ∈ 𝑎   ▶   ((𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)   )
7		onfrALTlem2VD 45333	. . . . . . . . . . 11 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   (𝑥 ∈ 𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅)   ▶   ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅   )
8	7	in2an 45053	. . . . . . . . . 10 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥 ∈ 𝑎   ▶   (¬ (𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)   )
9		pm2.61 192	. . . . . . . . . . 11 ⊢ (((𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → ((¬ (𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅))
10	9	a1i 11	. . . . . . . . . 10 ⊢ (((𝑎 ∩ 𝑥) = ∅ ∨ ¬ (𝑎 ∩ 𝑥) = ∅) → (((𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → ((¬ (𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)))
11	4, 6, 8, 10	e022 45086	. . . . . . . . 9 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ,   𝑥 ∈ 𝑎   ▶   ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅   )
12	11	in2 45050	. . . . . . . 8 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)   )
13	12	gen11 45061	. . . . . . 7 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   ∀𝑥(𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)   )
14		19.23v 1944	. . . . . . . 8 ⊢ (∀𝑥(𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) ↔ (∃𝑥 𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅))
15	14	biimpi 216	. . . . . . 7 ⊢ (∀𝑥(𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → (∃𝑥 𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅))
16	13, 15	e1a 45072	. . . . . 6 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (∃𝑥 𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)   )
17		n0 4294	. . . . . 6 ⊢ (𝑎 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝑎)
18		imbi1 347	. . . . . . 7 ⊢ ((𝑎 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝑎) → ((𝑎 ≠ ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) ↔ (∃𝑥 𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)))
19	18	biimprcd 250	. . . . . 6 ⊢ ((∃𝑥 𝑥 ∈ 𝑎 → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → ((𝑎 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝑎) → (𝑎 ≠ ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)))
20	16, 17, 19	e10 45139	. . . . 5 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   (𝑎 ≠ ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)   )
21		pm2.27 42	. . . . 5 ⊢ (𝑎 ≠ ∅ → ((𝑎 ≠ ∅ → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅))
22	3, 20, 21	e11 45133	. . . 4 ⊢ (   (𝑎 ⊆ On ∧ 𝑎 ≠ ∅)   ▶   ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅   )
23	22	in1 45016	. . 3 ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)
24	23	ax-gen 1797	. 2 ⊢ ∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅)
25		dfepfr 5608	. . 3 ⊢ ( E Fr On ↔ ∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅))
26	25	biimpri 228	. 2 ⊢ (∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅) → E Fr On)
27	24, 26	e0a 45216	1 ⊢ E Fr On

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848  ∀wal 1540   = wceq 1542  ∃wex 1781   ∈ wcel 2114   ≠ wne 2933  ∃wrex 3062   ∩ cin 3889   ⊆ wss 3890  ∅c0 4274   E cep 5523   Fr wfr 5574  Oncon0 6317

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-13 2377  ax-ext 2709  ax-sep 5231  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-tr 5194  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-ord 6320  df-on 6321  df-vd1 45015  df-vd2 45023  df-vd3 45035

This theorem is referenced by: (None)