Theorem soisores 7178

Description: Express the condition of isomorphism on two strict orders for a function's restriction. (Contributed by Mario Carneiro, 22-Jan-2015.)

Assertion

Ref	Expression
soisores	⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵)) → ((𝐹 ↾ 𝐴) Isom 𝑅, 𝑆 (𝐴, (𝐹 “ 𝐴)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐹,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦

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

Proof of Theorem soisores

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isorel 7177	. . . . 5 ⊢ (((𝐹 ↾ 𝐴) Isom 𝑅, 𝑆 (𝐴, (𝐹 “ 𝐴)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥𝑅𝑦 ↔ ((𝐹 ↾ 𝐴)‘𝑥)𝑆((𝐹 ↾ 𝐴)‘𝑦)))
2		fvres 6775	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
3		fvres 6775	. . . . . . 7 ⊢ (𝑦 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑦) = (𝐹‘𝑦))
4	2, 3	breqan12d 5086	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (((𝐹 ↾ 𝐴)‘𝑥)𝑆((𝐹 ↾ 𝐴)‘𝑦) ↔ (𝐹‘𝑥)𝑆(𝐹‘𝑦)))
5	4	adantl 481	. . . . 5 ⊢ (((𝐹 ↾ 𝐴) Isom 𝑅, 𝑆 (𝐴, (𝐹 “ 𝐴)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝑥)𝑆((𝐹 ↾ 𝐴)‘𝑦) ↔ (𝐹‘𝑥)𝑆(𝐹‘𝑦)))
6	1, 5	bitrd 278	. . . 4 ⊢ (((𝐹 ↾ 𝐴) Isom 𝑅, 𝑆 (𝐴, (𝐹 “ 𝐴)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥𝑅𝑦 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝑦)))
7	6	biimpd 228	. . 3 ⊢ (((𝐹 ↾ 𝐴) Isom 𝑅, 𝑆 (𝐴, (𝐹 “ 𝐴)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦)))
8	7	ralrimivva 3114	. 2 ⊢ ((𝐹 ↾ 𝐴) Isom 𝑅, 𝑆 (𝐴, (𝐹 “ 𝐴)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦)))
9		ffn 6584	. . . . . . . 8 ⊢ (𝐹:𝐵⟶𝐶 → 𝐹 Fn 𝐵)
10	9	ad2antrl 724	. . . . . . 7 ⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵)) → 𝐹 Fn 𝐵)
11		simprr 769	. . . . . . 7 ⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵)) → 𝐴 ⊆ 𝐵)
12		fnssres 6539	. . . . . . 7 ⊢ ((𝐹 Fn 𝐵 ∧ 𝐴 ⊆ 𝐵) → (𝐹 ↾ 𝐴) Fn 𝐴)
13	10, 11, 12	syl2anc 583	. . . . . 6 ⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵)) → (𝐹 ↾ 𝐴) Fn 𝐴)
14	13	3adant3 1130	. . . . 5 ⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) → (𝐹 ↾ 𝐴) Fn 𝐴)
15		df-ima 5593	. . . . . . 7 ⊢ (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
16	15	eqcomi 2747	. . . . . 6 ⊢ ran (𝐹 ↾ 𝐴) = (𝐹 “ 𝐴)
17	16	a1i 11	. . . . 5 ⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) → ran (𝐹 ↾ 𝐴) = (𝐹 “ 𝐴))
18		fvres 6775	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑧) = (𝐹‘𝑧))
19		fvres 6775	. . . . . . . . 9 ⊢ (𝑤 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑤) = (𝐹‘𝑤))
20	18, 19	eqeqan12d 2752	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) → (((𝐹 ↾ 𝐴)‘𝑧) = ((𝐹 ↾ 𝐴)‘𝑤) ↔ (𝐹‘𝑧) = (𝐹‘𝑤)))
21	20	adantl 481	. . . . . . 7 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝑧) = ((𝐹 ↾ 𝐴)‘𝑤) ↔ (𝐹‘𝑧) = (𝐹‘𝑤)))
22		simprl 767	. . . . . . . . . . 11 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝑧 ∈ 𝐴)
23		simprr 769	. . . . . . . . . . 11 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝑤 ∈ 𝐴)
24		simpl3 1191	. . . . . . . . . . 11 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦)))
25		breq1 5073	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑧 → (𝑥𝑅𝑦 ↔ 𝑧𝑅𝑦))
26		fveq2 6756	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧))
27	26	breq1d 5080	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑧 → ((𝐹‘𝑥)𝑆(𝐹‘𝑦) ↔ (𝐹‘𝑧)𝑆(𝐹‘𝑦)))
28	25, 27	imbi12d 344	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑧 → ((𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦)) ↔ (𝑧𝑅𝑦 → (𝐹‘𝑧)𝑆(𝐹‘𝑦))))
29		breq2 5074	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑤 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝑤))
30		fveq2 6756	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑤 → (𝐹‘𝑦) = (𝐹‘𝑤))
31	30	breq2d 5082	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑤 → ((𝐹‘𝑧)𝑆(𝐹‘𝑦) ↔ (𝐹‘𝑧)𝑆(𝐹‘𝑤)))
32	29, 31	imbi12d 344	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑤 → ((𝑧𝑅𝑦 → (𝐹‘𝑧)𝑆(𝐹‘𝑦)) ↔ (𝑧𝑅𝑤 → (𝐹‘𝑧)𝑆(𝐹‘𝑤))))
33	28, 32	rspc2va 3563	. . . . . . . . . . 11 ⊢ (((𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) → (𝑧𝑅𝑤 → (𝐹‘𝑧)𝑆(𝐹‘𝑤)))
34	22, 23, 24, 33	syl21anc 834	. . . . . . . . . 10 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑧𝑅𝑤 → (𝐹‘𝑧)𝑆(𝐹‘𝑤)))
35		breq1 5073	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (𝑥𝑅𝑦 ↔ 𝑤𝑅𝑦))
36		fveq2 6756	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑤 → (𝐹‘𝑥) = (𝐹‘𝑤))
37	36	breq1d 5080	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → ((𝐹‘𝑥)𝑆(𝐹‘𝑦) ↔ (𝐹‘𝑤)𝑆(𝐹‘𝑦)))
38	35, 37	imbi12d 344	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑤 → ((𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦)) ↔ (𝑤𝑅𝑦 → (𝐹‘𝑤)𝑆(𝐹‘𝑦))))
39		breq2 5074	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑧 → (𝑤𝑅𝑦 ↔ 𝑤𝑅𝑧))
40		fveq2 6756	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑧 → (𝐹‘𝑦) = (𝐹‘𝑧))
41	40	breq2d 5082	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑧 → ((𝐹‘𝑤)𝑆(𝐹‘𝑦) ↔ (𝐹‘𝑤)𝑆(𝐹‘𝑧)))
42	39, 41	imbi12d 344	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑧 → ((𝑤𝑅𝑦 → (𝐹‘𝑤)𝑆(𝐹‘𝑦)) ↔ (𝑤𝑅𝑧 → (𝐹‘𝑤)𝑆(𝐹‘𝑧))))
43	38, 42	rspc2va 3563	. . . . . . . . . . 11 ⊢ (((𝑤 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) → (𝑤𝑅𝑧 → (𝐹‘𝑤)𝑆(𝐹‘𝑧)))
44	23, 22, 24, 43	syl21anc 834	. . . . . . . . . 10 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑤𝑅𝑧 → (𝐹‘𝑤)𝑆(𝐹‘𝑧)))
45	34, 44	orim12d 961	. . . . . . . . 9 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑧𝑅𝑤 ∨ 𝑤𝑅𝑧) → ((𝐹‘𝑧)𝑆(𝐹‘𝑤) ∨ (𝐹‘𝑤)𝑆(𝐹‘𝑧))))
46	45	con3d 152	. . . . . . . 8 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (¬ ((𝐹‘𝑧)𝑆(𝐹‘𝑤) ∨ (𝐹‘𝑤)𝑆(𝐹‘𝑧)) → ¬ (𝑧𝑅𝑤 ∨ 𝑤𝑅𝑧)))
47		simpl1r 1223	. . . . . . . . 9 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝑆 Or 𝐶)
48		simpl2l 1224	. . . . . . . . . 10 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝐹:𝐵⟶𝐶)
49		simpl2r 1225	. . . . . . . . . . 11 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝐴 ⊆ 𝐵)
50	49, 22	sseldd 3918	. . . . . . . . . 10 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝑧 ∈ 𝐵)
51	48, 50	ffvelrnd 6944	. . . . . . . . 9 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝐹‘𝑧) ∈ 𝐶)
52	49, 23	sseldd 3918	. . . . . . . . . 10 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝑤 ∈ 𝐵)
53	48, 52	ffvelrnd 6944	. . . . . . . . 9 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝐹‘𝑤) ∈ 𝐶)
54		sotrieq 5523	. . . . . . . . 9 ⊢ ((𝑆 Or 𝐶 ∧ ((𝐹‘𝑧) ∈ 𝐶 ∧ (𝐹‘𝑤) ∈ 𝐶)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ ¬ ((𝐹‘𝑧)𝑆(𝐹‘𝑤) ∨ (𝐹‘𝑤)𝑆(𝐹‘𝑧))))
55	47, 51, 53, 54	syl12anc 833	. . . . . . . 8 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ ¬ ((𝐹‘𝑧)𝑆(𝐹‘𝑤) ∨ (𝐹‘𝑤)𝑆(𝐹‘𝑧))))
56		simpl1l 1222	. . . . . . . . 9 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝑅 Or 𝐵)
57		sotrieq 5523	. . . . . . . . 9 ⊢ ((𝑅 Or 𝐵 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑧 = 𝑤 ↔ ¬ (𝑧𝑅𝑤 ∨ 𝑤𝑅𝑧)))
58	56, 50, 52, 57	syl12anc 833	. . . . . . . 8 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑧 = 𝑤 ↔ ¬ (𝑧𝑅𝑤 ∨ 𝑤𝑅𝑧)))
59	46, 55, 58	3imtr4d 293	. . . . . . 7 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤))
60	21, 59	sylbid 239	. . . . . 6 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝑧) = ((𝐹 ↾ 𝐴)‘𝑤) → 𝑧 = 𝑤))
61	60	ralrimivva 3114	. . . . 5 ⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) → ∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (((𝐹 ↾ 𝐴)‘𝑧) = ((𝐹 ↾ 𝐴)‘𝑤) → 𝑧 = 𝑤))
62		dff1o6 7128	. . . . 5 ⊢ ((𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴) ↔ ((𝐹 ↾ 𝐴) Fn 𝐴 ∧ ran (𝐹 ↾ 𝐴) = (𝐹 “ 𝐴) ∧ ∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (((𝐹 ↾ 𝐴)‘𝑧) = ((𝐹 ↾ 𝐴)‘𝑤) → 𝑧 = 𝑤)))
63	14, 17, 61, 62	syl3anbrc 1341	. . . 4 ⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) → (𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴))
64		fveq2 6756	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → (𝐹‘𝑧) = (𝐹‘𝑤))
65	64	a1i 11	. . . . . . . . . 10 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑧 = 𝑤 → (𝐹‘𝑧) = (𝐹‘𝑤)))
66	65, 44	orim12d 961	. . . . . . . . 9 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑧 = 𝑤 ∨ 𝑤𝑅𝑧) → ((𝐹‘𝑧) = (𝐹‘𝑤) ∨ (𝐹‘𝑤)𝑆(𝐹‘𝑧))))
67	66	con3d 152	. . . . . . . 8 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (¬ ((𝐹‘𝑧) = (𝐹‘𝑤) ∨ (𝐹‘𝑤)𝑆(𝐹‘𝑧)) → ¬ (𝑧 = 𝑤 ∨ 𝑤𝑅𝑧)))
68		sotric 5522	. . . . . . . . 9 ⊢ ((𝑆 Or 𝐶 ∧ ((𝐹‘𝑧) ∈ 𝐶 ∧ (𝐹‘𝑤) ∈ 𝐶)) → ((𝐹‘𝑧)𝑆(𝐹‘𝑤) ↔ ¬ ((𝐹‘𝑧) = (𝐹‘𝑤) ∨ (𝐹‘𝑤)𝑆(𝐹‘𝑧))))
69	47, 51, 53, 68	syl12anc 833	. . . . . . . 8 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝐹‘𝑧)𝑆(𝐹‘𝑤) ↔ ¬ ((𝐹‘𝑧) = (𝐹‘𝑤) ∨ (𝐹‘𝑤)𝑆(𝐹‘𝑧))))
70		sotric 5522	. . . . . . . . 9 ⊢ ((𝑅 Or 𝐵 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑧𝑅𝑤 ↔ ¬ (𝑧 = 𝑤 ∨ 𝑤𝑅𝑧)))
71	56, 50, 52, 70	syl12anc 833	. . . . . . . 8 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑧𝑅𝑤 ↔ ¬ (𝑧 = 𝑤 ∨ 𝑤𝑅𝑧)))
72	67, 69, 71	3imtr4d 293	. . . . . . 7 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝐹‘𝑧)𝑆(𝐹‘𝑤) → 𝑧𝑅𝑤))
73	34, 72	impbid 211	. . . . . 6 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑧𝑅𝑤 ↔ (𝐹‘𝑧)𝑆(𝐹‘𝑤)))
74	18, 19	breqan12d 5086	. . . . . . 7 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) → (((𝐹 ↾ 𝐴)‘𝑧)𝑆((𝐹 ↾ 𝐴)‘𝑤) ↔ (𝐹‘𝑧)𝑆(𝐹‘𝑤)))
75	74	adantl 481	. . . . . 6 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝑧)𝑆((𝐹 ↾ 𝐴)‘𝑤) ↔ (𝐹‘𝑧)𝑆(𝐹‘𝑤)))
76	73, 75	bitr4d 281	. . . . 5 ⊢ ((((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) ∧ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑧𝑅𝑤 ↔ ((𝐹 ↾ 𝐴)‘𝑧)𝑆((𝐹 ↾ 𝐴)‘𝑤)))
77	76	ralrimivva 3114	. . . 4 ⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) → ∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (𝑧𝑅𝑤 ↔ ((𝐹 ↾ 𝐴)‘𝑧)𝑆((𝐹 ↾ 𝐴)‘𝑤)))
78		df-isom 6427	. . . 4 ⊢ ((𝐹 ↾ 𝐴) Isom 𝑅, 𝑆 (𝐴, (𝐹 “ 𝐴)) ↔ ((𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴) ∧ ∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (𝑧𝑅𝑤 ↔ ((𝐹 ↾ 𝐴)‘𝑧)𝑆((𝐹 ↾ 𝐴)‘𝑤))))
79	63, 77, 78	sylanbrc 582	. . 3 ⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))) → (𝐹 ↾ 𝐴) Isom 𝑅, 𝑆 (𝐴, (𝐹 “ 𝐴)))
80	79	3expia 1119	. 2 ⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵)) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦)) → (𝐹 ↾ 𝐴) Isom 𝑅, 𝑆 (𝐴, (𝐹 “ 𝐴))))
81	8, 80	impbid2 225	1 ⊢ (((𝑅 Or 𝐵 ∧ 𝑆 Or 𝐶) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐴 ⊆ 𝐵)) → ((𝐹 ↾ 𝐴) Isom 𝑅, 𝑆 (𝐴, (𝐹 “ 𝐴)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐹‘𝑥)𝑆(𝐹‘𝑦))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 843   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ∀wral 3063   ⊆ wss 3883   class class class wbr 5070   Or wor 5493  ran crn 5581   ↾ cres 5582   “ cima 5583   Fn wfn 6413  ⟶wf 6414  –1-1-onto→wf1o 6417  ‘cfv 6418   Isom wiso 6419

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-id 5480  df-po 5494  df-so 5495  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-isom 6427

This theorem is referenced by:  isercolllem1  15304  dvgt0lem2  25072  erdszelem4  33056  erdszelem8  33060  erdsze2lem2  33066