Theorem eqord1 8430

Description: A strictly increasing real function on a subset of ℝ is one-to-one. (Contributed by Mario Carneiro, 14-Jun-2014.) (Revised by Jim Kingdon, 20-Dec-2022.)

Hypotheses

Ref	Expression
ltord.1	⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)
ltord.2	⊢ (𝑥 = 𝐶 → 𝐴 = 𝑀)
ltord.3	⊢ (𝑥 = 𝐷 → 𝐴 = 𝑁)
ltord.4	⊢ 𝑆 ⊆ ℝ
ltord.5	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ℝ)
ltord.6	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 < 𝑦 → 𝐴 < 𝐵))

Assertion

Ref	Expression
eqord1	⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 = 𝐷 ↔ 𝑀 = 𝑁))

Distinct variable groups:   𝑥,𝐵   𝑥,𝑦,𝐶   𝑥,𝐷,𝑦   𝑥,𝑀,𝑦   𝑥,𝑁,𝑦   𝜑,𝑥,𝑦   𝑥,𝑆,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑦)

Proof of Theorem eqord1

Step	Hyp	Ref	Expression
1		simprl 529	. . . . . 6 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝐶 ∈ 𝑆)
2		elisset 2751	. . . . . 6 ⊢ (𝐶 ∈ 𝑆 → ∃𝑥 𝑥 = 𝐶)
3	1, 2	syl 14	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → ∃𝑥 𝑥 = 𝐶)
4	3	adantr 276	. . . 4 ⊢ (((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) ∧ 𝐶 = 𝐷) → ∃𝑥 𝑥 = 𝐶)
5		ltord.2	. . . . . 6 ⊢ (𝑥 = 𝐶 → 𝐴 = 𝑀)
6	5	adantl 277	. . . . 5 ⊢ ((((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) ∧ 𝐶 = 𝐷) ∧ 𝑥 = 𝐶) → 𝐴 = 𝑀)
7		eqeq2 2187	. . . . . . . 8 ⊢ (𝐶 = 𝐷 → (𝑥 = 𝐶 ↔ 𝑥 = 𝐷))
8	7	adantl 277	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) ∧ 𝐶 = 𝐷) → (𝑥 = 𝐶 ↔ 𝑥 = 𝐷))
9	8	biimpa 296	. . . . . 6 ⊢ ((((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) ∧ 𝐶 = 𝐷) ∧ 𝑥 = 𝐶) → 𝑥 = 𝐷)
10		ltord.3	. . . . . 6 ⊢ (𝑥 = 𝐷 → 𝐴 = 𝑁)
11	9, 10	syl 14	. . . . 5 ⊢ ((((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) ∧ 𝐶 = 𝐷) ∧ 𝑥 = 𝐶) → 𝐴 = 𝑁)
12	6, 11	eqtr3d 2212	. . . 4 ⊢ ((((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) ∧ 𝐶 = 𝐷) ∧ 𝑥 = 𝐶) → 𝑀 = 𝑁)
13	4, 12	exlimddv 1898	. . 3 ⊢ (((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) ∧ 𝐶 = 𝐷) → 𝑀 = 𝑁)
14	13	ex 115	. 2 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 = 𝐷 → 𝑀 = 𝑁))
15		ltord.1	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)
16		ltord.4	. . . . . 6 ⊢ 𝑆 ⊆ ℝ
17		ltord.5	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ℝ)
18		ltord.6	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 < 𝑦 → 𝐴 < 𝐵))
19	15, 5, 10, 16, 17, 18	ltordlem 8429	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 < 𝐷 → 𝑀 < 𝑁))
20	19	con3d 631	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (¬ 𝑀 < 𝑁 → ¬ 𝐶 < 𝐷))
21	15, 10, 5, 16, 17, 18	ltordlem 8429	. . . . . 6 ⊢ ((𝜑 ∧ (𝐷 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (𝐷 < 𝐶 → 𝑁 < 𝑀))
22	21	con3d 631	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (¬ 𝑁 < 𝑀 → ¬ 𝐷 < 𝐶))
23	22	ancom2s 566	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (¬ 𝑁 < 𝑀 → ¬ 𝐷 < 𝐶))
24	20, 23	anim12d 335	. . 3 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → ((¬ 𝑀 < 𝑁 ∧ ¬ 𝑁 < 𝑀) → (¬ 𝐶 < 𝐷 ∧ ¬ 𝐷 < 𝐶)))
25	17	ralrimiva 2550	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ)
26	5	eleq1d 2246	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝐴 ∈ ℝ ↔ 𝑀 ∈ ℝ))
27	26	rspccva 2840	. . . . . 6 ⊢ ((∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ ∧ 𝐶 ∈ 𝑆) → 𝑀 ∈ ℝ)
28	25, 27	sylan 283	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑆) → 𝑀 ∈ ℝ)
29	28	adantrr 479	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝑀 ∈ ℝ)
30	10	eleq1d 2246	. . . . . . 7 ⊢ (𝑥 = 𝐷 → (𝐴 ∈ ℝ ↔ 𝑁 ∈ ℝ))
31	30	rspccva 2840	. . . . . 6 ⊢ ((∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ ∧ 𝐷 ∈ 𝑆) → 𝑁 ∈ ℝ)
32	25, 31	sylan 283	. . . . 5 ⊢ ((𝜑 ∧ 𝐷 ∈ 𝑆) → 𝑁 ∈ ℝ)
33	32	adantrl 478	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝑁 ∈ ℝ)
34	29, 33	lttri3d 8062	. . 3 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝑀 = 𝑁 ↔ (¬ 𝑀 < 𝑁 ∧ ¬ 𝑁 < 𝑀)))
35	16, 1	sselid 3153	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝐶 ∈ ℝ)
36		simprr 531	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝐷 ∈ 𝑆)
37	16, 36	sselid 3153	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝐷 ∈ ℝ)
38	35, 37	lttri3d 8062	. . 3 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 = 𝐷 ↔ (¬ 𝐶 < 𝐷 ∧ ¬ 𝐷 < 𝐶)))
39	24, 34, 38	3imtr4d 203	. 2 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝑀 = 𝑁 → 𝐶 = 𝐷))
40	14, 39	impbid 129	1 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 = 𝐷 ↔ 𝑀 = 𝑁))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1353  ∃wex 1492   ∈ wcel 2148  ∀wral 2455   ⊆ wss 3129   class class class wbr 4000  ℝcr 7801   < clt 7982

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-cnex 7893  ax-resscn 7894  ax-pre-ltirr 7914  ax-pre-apti 7917

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-opab 4062  df-xp 4629  df-pnf 7984  df-mnf 7985  df-ltxr 7987

This theorem is referenced by:  eqord2  8431  reef11  11691  nninfdclemf1  12436