Theorem onint 7789

Description: The intersection (infimum) of a nonempty class of ordinal numbers belongs to the class. Compare Exercise 4 of [TakeutiZaring] p. 45. (Contributed by NM, 31-Jan-1997.)

Assertion

Ref	Expression
onint	⊢ ((𝐴 ⊆ On ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ 𝐴)

Proof of Theorem onint

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ordon 7776	. . . 4 ⊢ Ord On
2		tz7.5 6378	. . . 4 ⊢ ((Ord On ∧ 𝐴 ⊆ On ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 (𝐴 ∩ 𝑥) = ∅)
3	1, 2	mp3an1 1450	. . 3 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 (𝐴 ∩ 𝑥) = ∅)
4		ssel 3957	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ⊆ On → (𝑥 ∈ 𝐴 → 𝑥 ∈ On))
5	4	imdistani 568	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ On ∧ 𝑥 ∈ 𝐴) → (𝐴 ⊆ On ∧ 𝑥 ∈ On))
6		ssel 3957	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐴 ⊆ On → (𝑧 ∈ 𝐴 → 𝑧 ∈ On))
7		ontri1 6391	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑥 ∈ On ∧ 𝑧 ∈ On) → (𝑥 ⊆ 𝑧 ↔ ¬ 𝑧 ∈ 𝑥))
8		ssel 3957	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥 ⊆ 𝑧 → (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑧))
9	7, 8	biimtrrdi 254	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ On ∧ 𝑧 ∈ On) → (¬ 𝑧 ∈ 𝑥 → (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑧)))
10	9	ex 412	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ On → (𝑧 ∈ On → (¬ 𝑧 ∈ 𝑥 → (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑧))))
11	6, 10	sylan9 507	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐴 ⊆ On ∧ 𝑥 ∈ On) → (𝑧 ∈ 𝐴 → (¬ 𝑧 ∈ 𝑥 → (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑧))))
12	11	com4r 94	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ 𝑥 → ((𝐴 ⊆ On ∧ 𝑥 ∈ On) → (𝑧 ∈ 𝐴 → (¬ 𝑧 ∈ 𝑥 → 𝑦 ∈ 𝑧))))
13	12	imp31 417	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑦 ∈ 𝑥 ∧ (𝐴 ⊆ On ∧ 𝑥 ∈ On)) ∧ 𝑧 ∈ 𝐴) → (¬ 𝑧 ∈ 𝑥 → 𝑦 ∈ 𝑧))
14	13	ralimdva 3153	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ 𝑥 ∧ (𝐴 ⊆ On ∧ 𝑥 ∈ On)) → (∀𝑧 ∈ 𝐴 ¬ 𝑧 ∈ 𝑥 → ∀𝑧 ∈ 𝐴 𝑦 ∈ 𝑧))
15		disj 4430	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∩ 𝑥) = ∅ ↔ ∀𝑧 ∈ 𝐴 ¬ 𝑧 ∈ 𝑥)
16		vex 3468	. . . . . . . . . . . . . . . . 17 ⊢ 𝑦 ∈ V
17	16	elint2 4934	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ ∩ 𝐴 ↔ ∀𝑧 ∈ 𝐴 𝑦 ∈ 𝑧)
18	14, 15, 17	3imtr4g 296	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ 𝑥 ∧ (𝐴 ⊆ On ∧ 𝑥 ∈ On)) → ((𝐴 ∩ 𝑥) = ∅ → 𝑦 ∈ ∩ 𝐴))
19	5, 18	sylan2 593	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ 𝑥 ∧ (𝐴 ⊆ On ∧ 𝑥 ∈ 𝐴)) → ((𝐴 ∩ 𝑥) = ∅ → 𝑦 ∈ ∩ 𝐴))
20	19	exp32 420	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝑥 → (𝐴 ⊆ On → (𝑥 ∈ 𝐴 → ((𝐴 ∩ 𝑥) = ∅ → 𝑦 ∈ ∩ 𝐴))))
21	20	com4l 92	. . . . . . . . . . . 12 ⊢ (𝐴 ⊆ On → (𝑥 ∈ 𝐴 → ((𝐴 ∩ 𝑥) = ∅ → (𝑦 ∈ 𝑥 → 𝑦 ∈ ∩ 𝐴))))
22	21	imp32 418	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ (𝐴 ∩ 𝑥) = ∅)) → (𝑦 ∈ 𝑥 → 𝑦 ∈ ∩ 𝐴))
23	22	ssrdv 3969	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ (𝐴 ∩ 𝑥) = ∅)) → 𝑥 ⊆ ∩ 𝐴)
24		intss1 4944	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 → ∩ 𝐴 ⊆ 𝑥)
25	24	ad2antrl 728	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ (𝐴 ∩ 𝑥) = ∅)) → ∩ 𝐴 ⊆ 𝑥)
26	23, 25	eqssd 3981	. . . . . . . . 9 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ (𝐴 ∩ 𝑥) = ∅)) → 𝑥 = ∩ 𝐴)
27	26	eleq1d 2820	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ (𝐴 ∩ 𝑥) = ∅)) → (𝑥 ∈ 𝐴 ↔ ∩ 𝐴 ∈ 𝐴))
28	27	biimpd 229	. . . . . . 7 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ (𝐴 ∩ 𝑥) = ∅)) → (𝑥 ∈ 𝐴 → ∩ 𝐴 ∈ 𝐴))
29	28	exp32 420	. . . . . 6 ⊢ (𝐴 ⊆ On → (𝑥 ∈ 𝐴 → ((𝐴 ∩ 𝑥) = ∅ → (𝑥 ∈ 𝐴 → ∩ 𝐴 ∈ 𝐴))))
30	29	com34 91	. . . . 5 ⊢ (𝐴 ⊆ On → (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝐴 ∩ 𝑥) = ∅ → ∩ 𝐴 ∈ 𝐴))))
31	30	pm2.43d 53	. . . 4 ⊢ (𝐴 ⊆ On → (𝑥 ∈ 𝐴 → ((𝐴 ∩ 𝑥) = ∅ → ∩ 𝐴 ∈ 𝐴)))
32	31	rexlimdv 3140	. . 3 ⊢ (𝐴 ⊆ On → (∃𝑥 ∈ 𝐴 (𝐴 ∩ 𝑥) = ∅ → ∩ 𝐴 ∈ 𝐴))
33	3, 32	syl5 34	. 2 ⊢ (𝐴 ⊆ On → ((𝐴 ⊆ On ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ 𝐴))
34	33	anabsi5 669	1 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2933  ∀wral 3052  ∃wrex 3061   ∩ cin 3930   ⊆ wss 3931  ∅c0 4313  ∩ cint 4927  Ord word 6356  Oncon0 6357

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2715  df-cleq 2728  df-clel 2810  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-int 4928  df-br 5125  df-opab 5187  df-tr 5235  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-ord 6360  df-on 6361

This theorem is referenced by:  onint0  7790  onssmin  7791  onminesb  7792  onminsb  7793  oninton  7794  oneqmin  7799  oeeulem  8618  nnawordex  8654  unblem1  9305  unblem2  9306  tz9.12lem3  9808  scott0  9905  cardid2  9972  ackbij1lem18  10255  cardcf  10271  cff1  10277  cflim2  10282  cfss  10284  cofsmo  10288  fin23lem26  10344  pwfseqlem3  10679  gruina  10837  2ndcdisj  23399  sltval2  27625  nocvxmin  27747  lrrecfr  27907  rankeq1o  36194  dnnumch3  43038  oninfint  43227  inaex  44288