Theorem chnso 18791

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 2762	. . . . 5 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → (♯‘𝐶) = (♯‘𝐶))
2		ischn 18774	. . . . . . 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 14657	. . . 4 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → 𝐶:(0..^(♯‘𝐶))⟶𝐴)
6	5	frnd 6716	. . 3 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → ran 𝐶 ⊆ 𝐴)
7		simpl 488	. . 3 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → < Po 𝐴)
8		poss 5561	. . 3 ⊢ (ran 𝐶 ⊆ 𝐴 → ( < Po 𝐴 → < Po ran 𝐶))
9	6, 7, 8	sylc 66	. 2 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → < Po ran 𝐶)
10		fzossz 13807	. . . . . . . . 9 ⊢ (0..^(♯‘𝐶)) ⊆ ℤ
11		simp-4r 796	. . . . . . . . 9 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑖 ∈ (0..^(♯‘𝐶)))
12	10, 11	sselid 3929	. . . . . . . 8 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑖 ∈ ℤ)
13	12	zred 12796	. . . . . . 7 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑖 ∈ ℝ)
14		simplr 781	. . . . . . . . 9 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑗 ∈ (0..^(♯‘𝐶)))
15	10, 14	sselid 3929	. . . . . . . 8 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑗 ∈ ℤ)
16	15	zred 12796	. . . . . . 7 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → 𝑗 ∈ ℝ)
17	13, 16	lttri4d 11444	. . . . . 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 13791	. . . . . . . . . . . 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 13789	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (0..^𝑗) ↔ (𝑖 ∈ (ℤ≥‘0) ∧ 𝑗 ∈ ℤ ∧ 𝑖 < 𝑗))
26	22, 23, 24, 25	syl3anbrc 1362	. . . . . . . . . 10 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑖 < 𝑗) → 𝑖 ∈ (0..^𝑗))
27	18, 19, 20, 26	chnlt 18790	. . . . . . . . 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 5136	. . . . . . . 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 6887	. . . . . . . . 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 2804	. . . . . . . 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 13791	. . . . . . . . . . . 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 13789	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (0..^𝑖) ↔ (𝑗 ∈ (ℤ≥‘0) ∧ 𝑖 ∈ ℤ ∧ 𝑗 < 𝑖))
46	42, 43, 44, 45	syl3anbrc 1362	. . . . . . . . . 10 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → 𝑗 ∈ (0..^𝑖))
47	38, 39, 40, 46	chnlt 18790	. . . . . . . . 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 5136	. . . . . . . 8 ⊢ ((((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) ∧ 𝑗 < 𝑖) → 𝑦 < 𝑥)
51	50	ex 418	. . . . . . 7 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → (𝑗 < 𝑖 → 𝑦 < 𝑥))
52	31, 37, 51	3orim123d 1472	. . . . . 6 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → ((𝑖 < 𝑗 ∨ 𝑖 = 𝑗 ∨ 𝑗 < 𝑖) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥)))
53	17, 52	mpd 16	. . . . 5 ⊢ (((((((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) ∧ 𝑖 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑖) = 𝑥) ∧ 𝑗 ∈ (0..^(♯‘𝐶))) ∧ (𝐶‘𝑗) = 𝑦) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
54	5	ffnd 6708	. . . . . . 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 6943	. . . . . . 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 3171	. . . 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 6943	. . . . . 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 3171	. . 3 ⊢ (((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ 𝑥 ∈ ran 𝐶) ∧ 𝑦 ∈ ran 𝐶) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
67	66	anasss 472	. 2 ⊢ ((( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) ∧ (𝑥 ∈ ran 𝐶 ∧ 𝑦 ∈ ran 𝐶)) → (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
68	9, 67	issod 5594	1 ⊢ (( < Po 𝐴 ∧ 𝐶 ∈ ( < Chain 𝐴)) → < Or ran 𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ w3o 1102   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087   ∖ cdif 3896   ⊆ wss 3899  {csn 4584   class class class wbr 5103   Po wpo 5557   Or wor 5558  dom cdm 5651  ran crn 5652   Fn wfn 6532  ‘cfv 6537  (class class class)co 7418  0cc0 11193  1c1 11194   < clt 11336   − cmin 11534  ℤcz 12686  ℤ_≥cuz 12958  ..^cfzo 13781  ♯chash 14467  Word cword 14651   Chain cchn 18772

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-er 8710  df-en 8967  df-dom 8968  df-sdom 8969  df-fin 8970  df-card 10013  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-nn 12329  df-n0 12600  df-xnn0 12673  df-z 12687  df-uz 12959  df-rp 13114  df-fz 13633  df-fzo 13782  df-hash 14468  df-word 14652  df-lsw 14701  df-concat 14709  df-s1 14736  df-substr 14782  df-pfx 14814  df-chn 18773

This theorem is used by: (None)