Theorem wetriext 4698

Description: A trichotomous well-order is extensional. (Contributed by Jim Kingdon, 26-Sep-2021.)

Hypotheses

Ref	Expression
wetriext.we	⊢ (𝜑 → 𝑅 We 𝐴)
wetriext.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
wetriext.tri	⊢ (𝜑 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎𝑅𝑏 ∨ 𝑎 = 𝑏 ∨ 𝑏𝑅𝑎))
wetriext.b	⊢ (𝜑 → 𝐵 ∈ 𝐴)
wetriext.c	⊢ (𝜑 → 𝐶 ∈ 𝐴)
wetriext.ext	⊢ (𝜑 → ∀𝑧 ∈ 𝐴 (𝑧𝑅𝐵 ↔ 𝑧𝑅𝐶))

Assertion

Ref	Expression
wetriext	⊢ (𝜑 → 𝐵 = 𝐶)

Distinct variable groups:   𝐴,𝑎,𝑏   𝑧,𝐴   𝐵,𝑎,𝑏   𝑧,𝐵   𝐶,𝑏   𝑧,𝐶   𝑅,𝑎,𝑏   𝑧,𝑅

Allowed substitution hints:   𝜑(𝑧,𝑎,𝑏)   𝐶(𝑎)   𝑉(𝑧,𝑎,𝑏)

Proof of Theorem wetriext

Step	Hyp	Ref	Expression
1		breq1 4111	. . . . . 6 ⊢ (𝑧 = 𝐵 → (𝑧𝑅𝐵 ↔ 𝐵𝑅𝐵))
2		breq1 4111	. . . . . 6 ⊢ (𝑧 = 𝐵 → (𝑧𝑅𝐶 ↔ 𝐵𝑅𝐶))
3	1, 2	bibi12d 235	. . . . 5 ⊢ (𝑧 = 𝐵 → ((𝑧𝑅𝐵 ↔ 𝑧𝑅𝐶) ↔ (𝐵𝑅𝐵 ↔ 𝐵𝑅𝐶)))
4		wetriext.ext	. . . . 5 ⊢ (𝜑 → ∀𝑧 ∈ 𝐴 (𝑧𝑅𝐵 ↔ 𝑧𝑅𝐶))
5		wetriext.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝐴)
6	3, 4, 5	rspcdva 2925	. . . 4 ⊢ (𝜑 → (𝐵𝑅𝐵 ↔ 𝐵𝑅𝐶))
7	6	biimpar 297	. . 3 ⊢ ((𝜑 ∧ 𝐵𝑅𝐶) → 𝐵𝑅𝐵)
8		wetriext.we	. . . . . 6 ⊢ (𝜑 → 𝑅 We 𝐴)
9		wefr 4478	. . . . . 6 ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴)
10	8, 9	syl 14	. . . . 5 ⊢ (𝜑 → 𝑅 Fr 𝐴)
11		wetriext.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
12		frirrg 4470	. . . . 5 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵)
13	10, 11, 5, 12	syl3anc 1274	. . . 4 ⊢ (𝜑 → ¬ 𝐵𝑅𝐵)
14	13	adantr 276	. . 3 ⊢ ((𝜑 ∧ 𝐵𝑅𝐶) → ¬ 𝐵𝑅𝐵)
15	7, 14	pm2.21dd 625	. 2 ⊢ ((𝜑 ∧ 𝐵𝑅𝐶) → 𝐵 = 𝐶)
16		simpr 110	. 2 ⊢ ((𝜑 ∧ 𝐵 = 𝐶) → 𝐵 = 𝐶)
17		breq1 4111	. . . . . 6 ⊢ (𝑧 = 𝐶 → (𝑧𝑅𝐵 ↔ 𝐶𝑅𝐵))
18		breq1 4111	. . . . . 6 ⊢ (𝑧 = 𝐶 → (𝑧𝑅𝐶 ↔ 𝐶𝑅𝐶))
19	17, 18	bibi12d 235	. . . . 5 ⊢ (𝑧 = 𝐶 → ((𝑧𝑅𝐵 ↔ 𝑧𝑅𝐶) ↔ (𝐶𝑅𝐵 ↔ 𝐶𝑅𝐶)))
20		wetriext.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝐴)
21	19, 4, 20	rspcdva 2925	. . . 4 ⊢ (𝜑 → (𝐶𝑅𝐵 ↔ 𝐶𝑅𝐶))
22	21	biimpa 296	. . 3 ⊢ ((𝜑 ∧ 𝐶𝑅𝐵) → 𝐶𝑅𝐶)
23		frirrg 4470	. . . . 5 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝐴) → ¬ 𝐶𝑅𝐶)
24	10, 11, 20, 23	syl3anc 1274	. . . 4 ⊢ (𝜑 → ¬ 𝐶𝑅𝐶)
25	24	adantr 276	. . 3 ⊢ ((𝜑 ∧ 𝐶𝑅𝐵) → ¬ 𝐶𝑅𝐶)
26	22, 25	pm2.21dd 625	. 2 ⊢ ((𝜑 ∧ 𝐶𝑅𝐵) → 𝐵 = 𝐶)
27		wetriext.tri	. . 3 ⊢ (𝜑 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎𝑅𝑏 ∨ 𝑎 = 𝑏 ∨ 𝑏𝑅𝑎))
28		breq1 4111	. . . . . 6 ⊢ (𝑎 = 𝐵 → (𝑎𝑅𝑏 ↔ 𝐵𝑅𝑏))
29		eqeq1 2239	. . . . . 6 ⊢ (𝑎 = 𝐵 → (𝑎 = 𝑏 ↔ 𝐵 = 𝑏))
30		breq2 4112	. . . . . 6 ⊢ (𝑎 = 𝐵 → (𝑏𝑅𝑎 ↔ 𝑏𝑅𝐵))
31	28, 29, 30	3orbi123d 1348	. . . . 5 ⊢ (𝑎 = 𝐵 → ((𝑎𝑅𝑏 ∨ 𝑎 = 𝑏 ∨ 𝑏𝑅𝑎) ↔ (𝐵𝑅𝑏 ∨ 𝐵 = 𝑏 ∨ 𝑏𝑅𝐵)))
32		breq2 4112	. . . . . 6 ⊢ (𝑏 = 𝐶 → (𝐵𝑅𝑏 ↔ 𝐵𝑅𝐶))
33		eqeq2 2242	. . . . . 6 ⊢ (𝑏 = 𝐶 → (𝐵 = 𝑏 ↔ 𝐵 = 𝐶))
34		breq1 4111	. . . . . 6 ⊢ (𝑏 = 𝐶 → (𝑏𝑅𝐵 ↔ 𝐶𝑅𝐵))
35	32, 33, 34	3orbi123d 1348	. . . . 5 ⊢ (𝑏 = 𝐶 → ((𝐵𝑅𝑏 ∨ 𝐵 = 𝑏 ∨ 𝑏𝑅𝐵) ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵)))
36	31, 35	rspc2v 2933	. . . 4 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎𝑅𝑏 ∨ 𝑎 = 𝑏 ∨ 𝑏𝑅𝑎) → (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵)))
37	5, 20, 36	syl2anc 411	. . 3 ⊢ (𝜑 → (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎𝑅𝑏 ∨ 𝑎 = 𝑏 ∨ 𝑏𝑅𝑎) → (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵)))
38	27, 37	mpd 13	. 2 ⊢ (𝜑 → (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵))
39	15, 16, 26, 38	mpjao3dan 1344	1 ⊢ (𝜑 → 𝐵 = 𝐶)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ w3o 1004   = wceq 1398   ∈ wcel 2203  ∀wral 2520   class class class wbr 4108   Fr wfr 4448   We wwe 4450

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214  ax-sep 4227

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-v 2814  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-sn 3694  df-pr 3695  df-op 3697  df-br 4109  df-frfor 4451  df-frind 4452  df-wetr 4454

This theorem is referenced by: (None)