Theorem eqord1 8555

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 2785	. . . . . 6 ⊢ (𝐶 ∈ 𝑆 → ∃𝑥 𝑥 = 𝐶)
3	1, 2	syl 14	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → ∃𝑥 𝑥 = 𝐶)
4	3	adantr 276	. . . 4 ⊢ (((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) ∧ 𝐶 = 𝐷) → ∃𝑥 𝑥 = 𝐶)
5		ltord.2	. . . . . 6 ⊢ (𝑥 = 𝐶 → 𝐴 = 𝑀)
6	5	adantl 277	. . . . 5 ⊢ ((((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) ∧ 𝐶 = 𝐷) ∧ 𝑥 = 𝐶) → 𝐴 = 𝑀)
7		eqeq2 2214	. . . . . . . 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 2239	. . . 4 ⊢ ((((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) ∧ 𝐶 = 𝐷) ∧ 𝑥 = 𝐶) → 𝑀 = 𝑁)
13	4, 12	exlimddv 1921	. . 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 8554	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 < 𝐷 → 𝑀 < 𝑁))
20	19	con3d 632	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (¬ 𝑀 < 𝑁 → ¬ 𝐶 < 𝐷))
21	15, 10, 5, 16, 17, 18	ltordlem 8554	. . . . . 6 ⊢ ((𝜑 ∧ (𝐷 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (𝐷 < 𝐶 → 𝑁 < 𝑀))
22	21	con3d 632	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (¬ 𝑁 < 𝑀 → ¬ 𝐷 < 𝐶))
23	22	ancom2s 566	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (¬ 𝑁 < 𝑀 → ¬ 𝐷 < 𝐶))
24	20, 23	anim12d 335	. . 3 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → ((¬ 𝑀 < 𝑁 ∧ ¬ 𝑁 < 𝑀) → (¬ 𝐶 < 𝐷 ∧ ¬ 𝐷 < 𝐶)))
25	17	ralrimiva 2578	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ)
26	5	eleq1d 2273	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝐴 ∈ ℝ ↔ 𝑀 ∈ ℝ))
27	26	rspccva 2875	. . . . . 6 ⊢ ((∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ ∧ 𝐶 ∈ 𝑆) → 𝑀 ∈ ℝ)
28	25, 27	sylan 283	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑆) → 𝑀 ∈ ℝ)
29	28	adantrr 479	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝑀 ∈ ℝ)
30	10	eleq1d 2273	. . . . . . 7 ⊢ (𝑥 = 𝐷 → (𝐴 ∈ ℝ ↔ 𝑁 ∈ ℝ))
31	30	rspccva 2875	. . . . . 6 ⊢ ((∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ ∧ 𝐷 ∈ 𝑆) → 𝑁 ∈ ℝ)
32	25, 31	sylan 283	. . . . 5 ⊢ ((𝜑 ∧ 𝐷 ∈ 𝑆) → 𝑁 ∈ ℝ)
33	32	adantrl 478	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝑁 ∈ ℝ)
34	29, 33	lttri3d 8186	. . 3 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝑀 = 𝑁 ↔ (¬ 𝑀 < 𝑁 ∧ ¬ 𝑁 < 𝑀)))
35	16, 1	sselid 3190	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝐶 ∈ ℝ)
36		simprr 531	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝐷 ∈ 𝑆)
37	16, 36	sselid 3190	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝐷 ∈ ℝ)
38	35, 37	lttri3d 8186	. . 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 1372  ∃wex 1514   ∈ wcel 2175  ∀wral 2483   ⊆ wss 3165   class class class wbr 4043  ℝcr 7923   < clt 8106

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 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-cnex 8015  ax-resscn 8016  ax-pre-ltirr 8036  ax-pre-apti 8039

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-nel 2471  df-ral 2488  df-rex 2489  df-rab 2492  df-v 2773  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-xp 4680  df-pnf 8108  df-mnf 8109  df-ltxr 8111

This theorem is referenced by:  eqord2  8556  reef11  11981  nninfdclemf1  12794