Theorem xoromon 35539

Description: ω is either an ordinal set or the proper class of all ordinal sets, but not both. This is a stronger version of omon 7880. (Contributed by BTernaryTau, 25-Jan-2026.)

Assertion

Ref	Expression
xoromon	⊢ (ω ∈ On ⊻ ω = On)

Proof of Theorem xoromon

Step	Hyp	Ref	Expression
1		omon 7880	. 2 ⊢ (ω ∈ On ∨ ω = On)
2		onprc 7783	. . . . . 6 ⊢ ¬ On ∈ V
3		prcnel 3482	. . . . . 6 ⊢ (¬ On ∈ V → ¬ On ∈ On)
4	2, 3	ax-mp 5	. . . . 5 ⊢ ¬ On ∈ On
5		eleq1 2853	. . . . 5 ⊢ (ω = On → (ω ∈ On ↔ On ∈ On))
6	4, 5	mtbiri 330	. . . 4 ⊢ (ω = On → ¬ ω ∈ On)
7	6	con2i 140	. . 3 ⊢ (ω ∈ On → ¬ ω = On)
8		imnan 405	. . 3 ⊢ ((ω ∈ On → ¬ ω = On) ↔ ¬ (ω ∈ On ∧ ω = On))
9	7, 8	mpbi 233	. 2 ⊢ ¬ (ω ∈ On ∧ ω = On)
10		xor2 1547	. 2 ⊢ ((ω ∈ On ⊻ ω = On) ↔ ((ω ∈ On ∨ ω = On) ∧ ¬ (ω ∈ On ∧ ω = On)))
11	1, 9, 10	mpbir2an 724	1 ⊢ (ω ∈ On ⊻ ω = On)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   ⊻ wxo 1541   = wceq 1570   ∈ wcel 2146  Vcvv 3457  Oncon0 6364  ωcom 7868

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-ext 2737  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-xor 1542  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  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-lim 6369  df-om 7869

This theorem is used by: (None)