chnso - Metamath Proof Explorer

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

Theorem chnso 18848

Description: A chain induces a total order. (Contributed by Thierry Arnoux, 19-Jun-2025.)

**Assertion**
Ref	Expression
chnso	⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → < Or ran 𝐶)

Proof of Theorem chnso Dummy variables 𝑥 𝑦 𝑖 𝑗 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2764	. . . . 5 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → (♯‘𝐶) = (♯‘𝐶))
2		ischn 18831	. . . . . . 7 ⊢ (𝐶 ∈ ( < Chain 𝐴) ↔ (𝐶 ∈ Word 𝐴 ∧ ∀𝑛 ∈ (dom 𝐶 ∖ {0})(𝐶‘(𝑛 − 1)) < (𝐶‘𝑛)))
3	2	bilani 510	. . . . . 6 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → (𝐶 ∈ Word 𝐴 ∧ ∀𝑛 ∈ (dom 𝐶 ∖ {0})(𝐶‘(𝑛 − 1)) < (𝐶‘𝑛)))
4	3	simpld 500	. . . . 5 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → 𝐶 ∈ Word 𝐴)
5	1, 4	wrdfd 14705	. . . 4 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → 𝐶:(0..^(♯‘𝐶))⟶𝐴)
6	5	frnd 6748	. . 3 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → ran 𝐶 ⊆ 𝐴)
7		simpl 488	. . 3 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → < Po 𝐴)
8		poss 5568	. . 3 ⊢ (ran 𝐶 ⊆ 𝐴 → ( < Po 𝐴 → < Po ran 𝐶))
9	6, 7, 8	sylc 66	. 2 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → < Po ran 𝐶)
10		fzossz 13854	. . . . . . . . 9 ⊢ (0..^(♯‘𝐶)) ⊆ ℤ
11		simp-4r 796	. . . . . . . . 9 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑖 ∈ (0..^(♯‘𝐶)))
12	10, 11	sselid 3911	. . . . . . . 8 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑖 ∈ ℤ)
13	12	zred 12843	. . . . . . 7 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑖 ∈ ℝ)
14		simplr 781	. . . . . . . . 9 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑗 ∈ (0..^(♯‘𝐶)))
15	10, 14	sselid 3911	. . . . . . . 8 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑗 ∈ ℤ)
16	15	zred 12843	. . . . . . 7 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑗 ∈ ℝ)
17	13, 16	lttri4d 11490	. . . . . 6 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → (𝑖 < 𝑗 ∨ 𝑖 = 𝑗 ∨ 𝑗 < 𝑖))
18		simp-8l 803	. . . . . . . . . 10 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → < Po 𝐴)
19		simp-8r 804	. . . . . . . . . 10 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → 𝐶 ∈ ( < Chain 𝐴))
20		simpllr 788	. . . . . . . . . 10 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → 𝑗 ∈ (0..^(♯‘𝐶)))
21		elfzouz 13838	. . . . . . . . . . . 12 ⊢ (𝑖 ∈ (0..^(♯‘𝐶)) → 𝑖 ∈ (ℤ_≥‘0))
22	21	ad5antlr 748	. . . . . . . . . . 11 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → 𝑖 ∈ (ℤ_≥‘0))
23	15	adantr 486	. . . . . . . . . . 11 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → 𝑗 ∈ ℤ)
24		simpr 490	. . . . . . . . . . 11 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → 𝑖 < 𝑗)
25		elfzo2 13836	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (0..^𝑗) ↔ (𝑖 ∈ (ℤ_≥‘0) ∧ 𝑗 ∈ ℤ ∧ 𝑖 < 𝑗))
26	22, 23, 24, 25	syl3anbrc 1362	. . . . . . . . . 10 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → 𝑖 ∈ (0..^𝑗))
27	18, 19, 20, 26	chnlt 18847	. . . . . . . . 9 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → (𝐶‘𝑖) < (𝐶‘𝑗))
28		simp-4r 796	. . . . . . . . 9 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → (𝐶‘𝑖) = 𝑥)
29		simplr 781	. . . . . . . . 9 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → (𝐶‘𝑗) = 𝑦)
30	27, 28, 29	3brtr3d 5142	. . . . . . . 8 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → 𝑥 < 𝑦)
31	30	ex 418	. . . . . . 7 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → (𝑖 < 𝑗 → 𝑥 < 𝑦))
32		simpr 490	. . . . . . . . . 10 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 = 𝑗) → 𝑖 = 𝑗)
33	32	fveq2d 6920	. . . . . . . . 9 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 = 𝑗) → (𝐶‘𝑖) = (𝐶‘𝑗))
34		simp-4r 796	. . . . . . . . 9 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 = 𝑗) → (𝐶‘𝑖) = 𝑥)
35		simplr 781	. . . . . . . . 9 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 = 𝑗) → (𝐶‘𝑗) = 𝑦)
36	33, 34, 35	3eqtr3d 2806	. . . . . . . 8 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 = 𝑗) → 𝑥 = 𝑦)
37	36	ex 418	. . . . . . 7 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → (𝑖 = 𝑗 → 𝑥 = 𝑦))
38		simp-8l 803	. . . . . . . . . 10 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → < Po 𝐴)
39		simp-8r 804	. . . . . . . . . 10 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → 𝐶 ∈ ( < Chain 𝐴))
40	11	adantr 486	. . . . . . . . . 10 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → 𝑖 ∈ (0..^(♯‘𝐶)))
41		elfzouz 13838	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ (0..^(♯‘𝐶)) → 𝑗 ∈ (ℤ_≥‘0))
42	41	ad3antlr 744	. . . . . . . . . . 11 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → 𝑗 ∈ (ℤ_≥‘0))
43	12	adantr 486	. . . . . . . . . . 11 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → 𝑖 ∈ ℤ)
44		simpr 490	. . . . . . . . . . 11 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → 𝑗 < 𝑖)
45		elfzo2 13836	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (0..^𝑖) ↔ (𝑗 ∈ (ℤ_≥‘0) ∧ 𝑖 ∈ ℤ ∧ 𝑗 < 𝑖))
46	42, 43, 44, 45	syl3anbrc 1362	. . . . . . . . . 10 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → 𝑗 ∈ (0..^𝑖))
47	38, 39, 40, 46	chnlt 18847	. . . . . . . . 9 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → (𝐶‘𝑗) < (𝐶‘𝑖))
48		simplr 781	. . . . . . . . 9 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → (𝐶‘𝑗) = 𝑦)
49		simp-4r 796	. . . . . . . . 9 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → (𝐶‘𝑖) = 𝑥)
50	47, 48, 49	3brtr3d 5142	. . . . . . . 8 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → 𝑦 < 𝑥)
51	50	ex 418	. . . . . . 7 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → (𝑗 < 𝑖 → 𝑦 < 𝑥))
52	31, 37, 51	3orim123d 1473	. . . . . 6 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → ((𝑖 < 𝑗 ∨ 𝑖 = 𝑗 ∨ 𝑗 < 𝑖) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥)))
53	17, 52	mpd 16	. . . . 5 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
54	5	ffnd 6740	. . . . . . 7 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → 𝐶 Fn (0..^(♯‘𝐶)))
55	54	ad4antr 745	. . . . . 6 ⊢ (((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) → 𝐶 Fn (0..^(♯‘𝐶)))
56		simpllr 788	. . . . . 6 ⊢ (((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) → 𝑦 ∈ ran 𝐶)
57		fvelrnb 6976	. . . . . . 7 ⊢ (𝐶 Fn (0..^(♯‘𝐶)) → (𝑦 ∈ ran 𝐶 ↔ ∃𝑗 ∈ (0..^(♯‘𝐶))(𝐶‘𝑗) = 𝑦))
58	57	biimpa 482	. . . . . 6 ⊢ ((𝐶 Fn (0..^(♯‘𝐶)) ∧ 𝑦 ∈ ran 𝐶) → ∃𝑗 ∈ (0..^(♯‘𝐶))(𝐶‘𝑗) = 𝑦)
59	55, 56, 58	syl2anc 596	. . . . 5 ⊢ (((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) → ∃𝑗 ∈ (0..^(♯‘𝐶))(𝐶‘𝑗) = 𝑦)
60	53, 59	r19.29a 3174	. . . 4 ⊢ (((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
61	54	ad2antrr 739	. . . . 5 ⊢ (((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) → 𝐶 Fn (0..^(♯‘𝐶)))
62		simplr 781	. . . . 5 ⊢ (((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) → 𝑥 ∈ ran 𝐶)
63		fvelrnb 6976	. . . . . 6 ⊢ (𝐶 Fn (0..^(♯‘𝐶)) → (𝑥 ∈ ran 𝐶 ↔ ∃𝑖 ∈ (0..^(♯‘𝐶))(𝐶‘𝑖) = 𝑥))
64	63	biimpa 482	. . . . 5 ⊢ ((𝐶 Fn (0..^(♯‘𝐶)) ∧ 𝑥 ∈ ran 𝐶) → ∃𝑖 ∈ (0..^(♯‘𝐶))(𝐶‘𝑖) = 𝑥)
65	61, 62, 64	syl2anc 596	. . . 4 ⊢ (((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) → ∃𝑖 ∈ (0..^(♯‘𝐶))(𝐶‘𝑖) = 𝑥)
66	60, 65	r19.29a 3174	. . 3 ⊢ (((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
67	66	anasss 472	. 2 ⊢ ((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ (𝑥 ∈ ran 𝐶 ∧ 𝑦 ∈ ran 𝐶)) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
68	9, 67	issod 5601	1 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → < Or ran 𝐶)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ w3o 1102 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 ⊆ wss 3900 ∖ cdif 4048 {csn 4588 class class class wbr 5108 Po wpo 5564 Or wor 5565 dom cdm 5658 ran crn 5659 Fn wfn 6561 ‘cfv 6566 (class class class)co 7451 0cc0 11239 1c1 11240 < clt 11382 − cmin 11580 ℤcz 12733 ℤ_≥cuz 13005 ..^cfzo 13828 ♯chash 14515 Word cword 14699 Chain cchn 18829

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-xnn0 12720 df-z 12734 df-uz 13006 df-rp 13161 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-lsw 14749 df-concat 14757 df-s1 14784 df-substr 14831 df-pfx 14863 df-chn 18830

This theorem is used by: (None)

W3C validator