Theorem ontric3g 43799

Description: For all 𝑥, 𝑦 ∈ On, one and only one of the following hold: 𝑥 ∈ 𝑦, 𝑦 = 𝑥, or 𝑦 ∈ 𝑥. This is a transparent strict trichotomy. (Contributed by RP, 27-Sep-2023.)

Assertion

Ref	Expression
ontric3g	⊢ ∀𝑥 ∈ On ∀𝑦 ∈ On ((𝑥 ∈ 𝑦 ↔ ¬ (𝑦 = 𝑥 ∨ 𝑦 ∈ 𝑥)) ∧ (𝑦 = 𝑥 ↔ ¬ (𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥)) ∧ (𝑦 ∈ 𝑥 ↔ ¬ (𝑥 ∈ 𝑦 ∨ 𝑦 = 𝑥)))

Distinct variable group:   𝑥,𝑦

Proof of Theorem ontric3g

Step	Hyp	Ref	Expression
1		orcom 871	. . . . . . 7 ⊢ ((𝑦 = 𝑥 ∨ 𝑦 ∈ 𝑥) ↔ (𝑦 ∈ 𝑥 ∨ 𝑦 = 𝑥))
2	1	a1i 11	. . . . . 6 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ On) → ((𝑦 = 𝑥 ∨ 𝑦 ∈ 𝑥) ↔ (𝑦 ∈ 𝑥 ∨ 𝑦 = 𝑥)))
3		onsseleq 6359	. . . . . 6 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ On) → (𝑦 ⊆ 𝑥 ↔ (𝑦 ∈ 𝑥 ∨ 𝑦 = 𝑥)))
4		ontri1 6352	. . . . . 6 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ On) → (𝑦 ⊆ 𝑥 ↔ ¬ 𝑥 ∈ 𝑦))
5	2, 3, 4	3bitr2d 307	. . . . 5 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ On) → ((𝑦 = 𝑥 ∨ 𝑦 ∈ 𝑥) ↔ ¬ 𝑥 ∈ 𝑦))
6	5	con2bid 354	. . . 4 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ On) → (𝑥 ∈ 𝑦 ↔ ¬ (𝑦 = 𝑥 ∨ 𝑦 ∈ 𝑥)))
7	6	ancoms 458	. . 3 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ∈ 𝑦 ↔ ¬ (𝑦 = 𝑥 ∨ 𝑦 ∈ 𝑥)))
8	4	ancoms 458	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑦 ⊆ 𝑥 ↔ ¬ 𝑥 ∈ 𝑦))
9		ontri1 6352	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝑥))
10	8, 9	anbi12d 633	. . . 4 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑦 ⊆ 𝑥 ∧ 𝑥 ⊆ 𝑦) ↔ (¬ 𝑥 ∈ 𝑦 ∧ ¬ 𝑦 ∈ 𝑥)))
11		eqss 3950	. . . 4 ⊢ (𝑦 = 𝑥 ↔ (𝑦 ⊆ 𝑥 ∧ 𝑥 ⊆ 𝑦))
12		ioran 986	. . . 4 ⊢ (¬ (𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥) ↔ (¬ 𝑥 ∈ 𝑦 ∧ ¬ 𝑦 ∈ 𝑥))
13	10, 11, 12	3bitr4g 314	. . 3 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑦 = 𝑥 ↔ ¬ (𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥)))
14		equcom 2020	. . . . . . 7 ⊢ (𝑦 = 𝑥 ↔ 𝑥 = 𝑦)
15	14	orbi2i 913	. . . . . 6 ⊢ ((𝑥 ∈ 𝑦 ∨ 𝑦 = 𝑥) ↔ (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦))
16	15	a1i 11	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥 ∈ 𝑦 ∨ 𝑦 = 𝑥) ↔ (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦)))
17		onsseleq 6359	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ⊆ 𝑦 ↔ (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦)))
18	16, 17, 9	3bitr2d 307	. . . 4 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥 ∈ 𝑦 ∨ 𝑦 = 𝑥) ↔ ¬ 𝑦 ∈ 𝑥))
19	18	con2bid 354	. . 3 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑦 ∈ 𝑥 ↔ ¬ (𝑥 ∈ 𝑦 ∨ 𝑦 = 𝑥)))
20	7, 13, 19	3jca 1129	. 2 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥 ∈ 𝑦 ↔ ¬ (𝑦 = 𝑥 ∨ 𝑦 ∈ 𝑥)) ∧ (𝑦 = 𝑥 ↔ ¬ (𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥)) ∧ (𝑦 ∈ 𝑥 ↔ ¬ (𝑥 ∈ 𝑦 ∨ 𝑦 = 𝑥))))
21	20	rgen2 3177	1 ⊢ ∀𝑥 ∈ On ∀𝑦 ∈ On ((𝑥 ∈ 𝑦 ↔ ¬ (𝑦 = 𝑥 ∨ 𝑦 ∈ 𝑥)) ∧ (𝑦 = 𝑥 ↔ ¬ (𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥)) ∧ (𝑦 ∈ 𝑥 ↔ ¬ (𝑥 ∈ 𝑦 ∨ 𝑦 = 𝑥)))

Syntax hints:  ¬ wn 3   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   ∈ wcel 2114  ∀wral 3052   ⊆ wss 3902  Oncon0 6318

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-ext 2709  ax-sep 5242  ax-nul 5252  ax-pr 5378

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-tr 5207  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-ord 6321  df-on 6322

This theorem is referenced by: (None)