ordtri3 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ordtri3		Structured version Visualization version GIF version

Theorem ordtri3 6419

Description: A trichotomy law for ordinals. (Contributed by NM, 18-Oct-1995.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) (Proof shortened by JJ, 24-Sep-2021.)

**Assertion**
Ref	Expression
ordtri3	⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ ¬ (𝐴 ∈ 𝐵 ∨ 𝐵 ∈ 𝐴)))

**Proof of Theorem ordtri3**
Step	Hyp	Ref	Expression
1		ordirr 6401	. . . . . 6 ⊢ (Ord 𝐵 → ¬ 𝐵 ∈ 𝐵)
2	1	adantl 481	. . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → ¬ 𝐵 ∈ 𝐵)
3		eleq2 2829	. . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐵 ∈ 𝐴 ↔ 𝐵 ∈ 𝐵))
4	3	notbid 318	. . . . 5 ⊢ (𝐴 = 𝐵 → (¬ 𝐵 ∈ 𝐴 ↔ ¬ 𝐵 ∈ 𝐵))
5	2, 4	syl5ibrcom 247	. . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 → ¬ 𝐵 ∈ 𝐴))
6	5	pm4.71d 561	. . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ (𝐴 = 𝐵 ∧ ¬ 𝐵 ∈ 𝐴)))
7		pm5.61 1002	. . . 4 ⊢ (((𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∧ ¬ 𝐵 ∈ 𝐴) ↔ (𝐴 = 𝐵 ∧ ¬ 𝐵 ∈ 𝐴))
8		pm4.52 986	. . . 4 ⊢ (((𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∧ ¬ 𝐵 ∈ 𝐴) ↔ ¬ (¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∨ 𝐵 ∈ 𝐴))
9	7, 8	bitr3i 277	. . 3 ⊢ ((𝐴 = 𝐵 ∧ ¬ 𝐵 ∈ 𝐴) ↔ ¬ (¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∨ 𝐵 ∈ 𝐴))
10	6, 9	bitrdi 287	. 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ ¬ (¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∨ 𝐵 ∈ 𝐴)))
11		ordtri2 6418	. . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
12	11	orbi1d 916	. . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐴 ∈ 𝐵 ∨ 𝐵 ∈ 𝐴) ↔ (¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∨ 𝐵 ∈ 𝐴)))
13	12	notbid 318	. 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (¬ (𝐴 ∈ 𝐵 ∨ 𝐵 ∈ 𝐴) ↔ ¬ (¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∨ 𝐵 ∈ 𝐴)))
14	10, 13	bitr4d 282	1 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ ¬ (𝐴 ∈ 𝐵 ∨ 𝐵 ∈ 𝐴)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1539 ∈ wcel 2107 Ord word 6382

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pr 5431

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2064 df-clab 2714 df-cleq 2728 df-clel 2815 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3436 df-v 3481 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-br 5143 df-opab 5205 df-tr 5259 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-we 5638 df-ord 6386

This theorem is referenced by: ordunisuc2 7866 tz7.48lem 8482 oacan 8587 omcan 8608 oecan 8628 omsmo 8697 omopthi 8700 inf3lem6 9674 cantnfp1lem3 9721 infpssrlem5 10348 fin23lem24 10363 isf32lem4 10397 om2uzf1oi 13995 om2noseqf1o 28308 ordnexbtwnsuc 43285

W3C validator