Theorem isoun 33366

Description: Infer an isomorphism from a union of two isomorphisms. (Contributed by Thierry Arnoux, 30-Mar-2017.)

Hypotheses

Ref	Expression
isoun.1	⊢ (𝜑 → 𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵))
isoun.2	⊢ (𝜑 → 𝐺 Isom 𝑅, 𝑆 (𝐶, 𝐷))
isoun.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) → 𝑥𝑅𝑦)
isoun.4	⊢ ((𝜑 ∧ 𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐷) → 𝑧𝑆𝑤)
isoun.5	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴) → ¬ 𝑥𝑅𝑦)
isoun.6	⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ 𝑤 ∈ 𝐵) → ¬ 𝑧𝑆𝑤)
isoun.7	⊢ (𝜑 → (𝐴 ∩ 𝐶) = ∅)
isoun.8	⊢ (𝜑 → (𝐵 ∩ 𝐷) = ∅)

Assertion

Ref	Expression
isoun	⊢ (𝜑 → (𝐻 ∪ 𝐺) Isom 𝑅, 𝑆 ((𝐴 ∪ 𝐶), (𝐵 ∪ 𝐷)))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝑤,𝑦,𝑧,𝐵   𝑥,𝐶,𝑦   𝑤,𝐷,𝑥,𝑦,𝑧   𝑤,𝐺,𝑥,𝑦,𝑧   𝑤,𝐻,𝑥,𝑦,𝑧   𝑥,𝑅,𝑦   𝑤,𝑆,𝑥,𝑦,𝑧   𝜑,𝑤,𝑥,𝑦,𝑧

Allowed substitution hints:   𝐴(𝑧, 𝑤)   𝐶(𝑧, 𝑤)   𝑅(𝑧, 𝑤)

Proof of Theorem isoun

Step	Hyp	Ref	Expression
1		isoun.1	. . . 4 ⊢ (𝜑 → 𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵))
2		isof1o 7354	. . . 4 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻:𝐴⟶1-1onto𝐵)
3	1, 2	syl 18	. . 3 ⊢ (𝜑 → 𝐻:𝐴⟶1-1onto𝐵)
4		isoun.2	. . . 4 ⊢ (𝜑 → 𝐺 Isom 𝑅, 𝑆 (𝐶, 𝐷))
5		isof1o 7354	. . . 4 ⊢ (𝐺 Isom 𝑅, 𝑆 (𝐶, 𝐷) → 𝐺:𝐶⟶1-1onto𝐷)
6	4, 5	syl 18	. . 3 ⊢ (𝜑 → 𝐺:𝐶⟶1-1onto𝐷)
7		isoun.7	. . 3 ⊢ (𝜑 → (𝐴 ∩ 𝐶) = ∅)
8		isoun.8	. . 3 ⊢ (𝜑 → (𝐵 ∩ 𝐷) = ∅)
9		f1oun 6866	. . 3 ⊢ (((𝐻:𝐴⟶1-1onto𝐵 ∧ 𝐺:𝐶⟶1-1onto𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐻 ∪ 𝐺):(𝐴 ∪ 𝐶)⟶1-1onto(𝐵 ∪ 𝐷))
10	3, 6, 7, 8, 9	syl22anc 852	. 2 ⊢ (𝜑 → (𝐻 ∪ 𝐺):(𝐴 ∪ 𝐶)⟶1-1onto(𝐵 ∪ 𝐷))
11		elun 4155	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐶) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐶))
12		elun 4155	. . . . . . . 8 ⊢ (𝑦 ∈ (𝐴 ∪ 𝐶) ↔ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐶))
13		isorel 7357	. . . . . . . . . . . 12 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))
14	1, 13	sylan 592	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))
15		f1ofn 6847	. . . . . . . . . . . . . . . 16 ⊢ (𝐻:𝐴⟶1-1onto𝐵 → 𝐻 Fn 𝐴)
16	3, 15	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐻 Fn 𝐴)
17	16	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐻 Fn 𝐴)
18		f1ofn 6847	. . . . . . . . . . . . . . . 16 ⊢ (𝐺:𝐶⟶1-1onto𝐷 → 𝐺 Fn 𝐶)
19	6, 18	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐺 Fn 𝐶)
20	19	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐺 Fn 𝐶)
21	7	anim1i 627	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐴 ∩ 𝐶) = ∅ ∧ 𝑥 ∈ 𝐴))
22		fvun1 6999	. . . . . . . . . . . . . 14 ⊢ ((𝐻 Fn 𝐴 ∧ 𝐺 Fn 𝐶 ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ 𝑥 ∈ 𝐴)) → ((𝐻 ∪ 𝐺)‘𝑥) = (𝐻‘𝑥))
23	17, 20, 21, 22	syl3anc 1399	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐻 ∪ 𝐺)‘𝑥) = (𝐻‘𝑥))
24	23	adantrr 730	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐻 ∪ 𝐺)‘𝑥) = (𝐻‘𝑥))
25	16	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐻 Fn 𝐴)
26	19	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐺 Fn 𝐶)
27	7	anim1i 627	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ((𝐴 ∩ 𝐶) = ∅ ∧ 𝑦 ∈ 𝐴))
28		fvun1 6999	. . . . . . . . . . . . . 14 ⊢ ((𝐻 Fn 𝐴 ∧ 𝐺 Fn 𝐶 ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ 𝑦 ∈ 𝐴)) → ((𝐻 ∪ 𝐺)‘𝑦) = (𝐻‘𝑦))
29	25, 26, 27, 28	syl3anc 1399	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ((𝐻 ∪ 𝐺)‘𝑦) = (𝐻‘𝑦))
30	29	adantrl 729	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐻 ∪ 𝐺)‘𝑦) = (𝐻‘𝑦))
31	24, 30	breq12d 5119	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦) ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))
32	14, 31	bitr4d 285	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
33	32	anassrs 473	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
34		isoun.3	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) → 𝑥𝑅𝑦)
35	34	3expb 1138	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) → 𝑥𝑅𝑦)
36		isoun.4	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐷) → 𝑧𝑆𝑤)
37	36	3expia 1139	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐵) → (𝑤 ∈ 𝐷 → 𝑧𝑆𝑤))
38	37	ralrimiv 3157	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐵) → ∀𝑤 ∈ 𝐷 𝑧𝑆𝑤)
39	38	ralrimiva 3158	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐷 𝑧𝑆𝑤)
40	39	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐷 𝑧𝑆𝑤)
41		f1of 6846	. . . . . . . . . . . . . . . . 17 ⊢ (𝐻:𝐴⟶1-1onto𝐵 → 𝐻:𝐴⟶𝐵)
42	3, 41	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐻:𝐴⟶𝐵)
43	42	ffvelcdmda 7108	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐻‘𝑥) ∈ 𝐵)
44	43	adantrr 730	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) → (𝐻‘𝑥) ∈ 𝐵)
45		f1of 6846	. . . . . . . . . . . . . . . . 17 ⊢ (𝐺:𝐶⟶1-1onto𝐷 → 𝐺:𝐶⟶𝐷)
46	6, 45	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐺:𝐶⟶𝐷)
47	46	ffvelcdmda 7108	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → (𝐺‘𝑦) ∈ 𝐷)
48	47	adantrl 729	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) → (𝐺‘𝑦) ∈ 𝐷)
49		breq1 5109	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = (𝐻‘𝑥) → (𝑧𝑆𝑤 ↔ (𝐻‘𝑥)𝑆𝑤))
50		breq2 5110	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝐺‘𝑦) → ((𝐻‘𝑥)𝑆𝑤 ↔ (𝐻‘𝑥)𝑆(𝐺‘𝑦)))
51	49, 50	rspc2v 3590	. . . . . . . . . . . . . 14 ⊢ (((𝐻‘𝑥) ∈ 𝐵 ∧ (𝐺‘𝑦) ∈ 𝐷) → (∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐷 𝑧𝑆𝑤 → (𝐻‘𝑥)𝑆(𝐺‘𝑦)))
52	44, 48, 51	syl2anc 596	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) → (∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐷 𝑧𝑆𝑤 → (𝐻‘𝑥)𝑆(𝐺‘𝑦)))
53	40, 52	mpd 16	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) → (𝐻‘𝑥)𝑆(𝐺‘𝑦))
54	23	adantrr 730	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) → ((𝐻 ∪ 𝐺)‘𝑥) = (𝐻‘𝑥))
55	16	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → 𝐻 Fn 𝐴)
56	19	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → 𝐺 Fn 𝐶)
57	7	anim1i 627	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → ((𝐴 ∩ 𝐶) = ∅ ∧ 𝑦 ∈ 𝐶))
58		fvun2 7000	. . . . . . . . . . . . . 14 ⊢ ((𝐻 Fn 𝐴 ∧ 𝐺 Fn 𝐶 ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ 𝑦 ∈ 𝐶)) → ((𝐻 ∪ 𝐺)‘𝑦) = (𝐺‘𝑦))
59	55, 56, 57, 58	syl3anc 1399	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → ((𝐻 ∪ 𝐺)‘𝑦) = (𝐺‘𝑦))
60	59	adantrl 729	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) → ((𝐻 ∪ 𝐺)‘𝑦) = (𝐺‘𝑦))
61	53, 54, 60	3brtr4d 5140	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) → ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦))
62	35, 61	2thd 268	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
63	62	anassrs 473	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐶) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
64	33, 63	jaodan 972	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐶)) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
65	12, 64	sylan2b 606	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐴 ∪ 𝐶)) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
66	65	ex 418	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ (𝐴 ∪ 𝐶) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦))))
67		isoun.5	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴) → ¬ 𝑥𝑅𝑦)
68	67	3expb 1138	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴)) → ¬ 𝑥𝑅𝑦)
69		isoun.6	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ 𝑤 ∈ 𝐵) → ¬ 𝑧𝑆𝑤)
70	69	3expia 1139	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → (𝑤 ∈ 𝐵 → ¬ 𝑧𝑆𝑤))
71	70	ralrimiv 3157	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → ∀𝑤 ∈ 𝐵 ¬ 𝑧𝑆𝑤)
72	71	ralrimiva 3158	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑧 ∈ 𝐷 ∀𝑤 ∈ 𝐵 ¬ 𝑧𝑆𝑤)
73	72	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴)) → ∀𝑧 ∈ 𝐷 ∀𝑤 ∈ 𝐵 ¬ 𝑧𝑆𝑤)
74	46	ffvelcdmda 7108	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐺‘𝑥) ∈ 𝐷)
75	74	adantrr 730	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴)) → (𝐺‘𝑥) ∈ 𝐷)
76	42	ffvelcdmda 7108	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐻‘𝑦) ∈ 𝐵)
77	76	adantrl 729	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴)) → (𝐻‘𝑦) ∈ 𝐵)
78		breq1 5109	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = (𝐺‘𝑥) → (𝑧𝑆𝑤 ↔ (𝐺‘𝑥)𝑆𝑤))
79	78	notbid 321	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = (𝐺‘𝑥) → (¬ 𝑧𝑆𝑤 ↔ ¬ (𝐺‘𝑥)𝑆𝑤))
80		breq2 5110	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝐻‘𝑦) → ((𝐺‘𝑥)𝑆𝑤 ↔ (𝐺‘𝑥)𝑆(𝐻‘𝑦)))
81	80	notbid 321	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝐻‘𝑦) → (¬ (𝐺‘𝑥)𝑆𝑤 ↔ ¬ (𝐺‘𝑥)𝑆(𝐻‘𝑦)))
82	79, 81	rspc2v 3590	. . . . . . . . . . . . . 14 ⊢ (((𝐺‘𝑥) ∈ 𝐷 ∧ (𝐻‘𝑦) ∈ 𝐵) → (∀𝑧 ∈ 𝐷 ∀𝑤 ∈ 𝐵 ¬ 𝑧𝑆𝑤 → ¬ (𝐺‘𝑥)𝑆(𝐻‘𝑦)))
83	75, 77, 82	syl2anc 596	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴)) → (∀𝑧 ∈ 𝐷 ∀𝑤 ∈ 𝐵 ¬ 𝑧𝑆𝑤 → ¬ (𝐺‘𝑥)𝑆(𝐻‘𝑦)))
84	73, 83	mpd 16	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴)) → ¬ (𝐺‘𝑥)𝑆(𝐻‘𝑦))
85	16	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐻 Fn 𝐴)
86	19	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐺 Fn 𝐶)
87	7	anim1i 627	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐴 ∩ 𝐶) = ∅ ∧ 𝑥 ∈ 𝐶))
88		fvun2 7000	. . . . . . . . . . . . . . 15 ⊢ ((𝐻 Fn 𝐴 ∧ 𝐺 Fn 𝐶 ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ 𝑥 ∈ 𝐶)) → ((𝐻 ∪ 𝐺)‘𝑥) = (𝐺‘𝑥))
89	85, 86, 87, 88	syl3anc 1399	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐻 ∪ 𝐺)‘𝑥) = (𝐺‘𝑥))
90	89	adantrr 730	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴)) → ((𝐻 ∪ 𝐺)‘𝑥) = (𝐺‘𝑥))
91	29	adantrl 729	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴)) → ((𝐻 ∪ 𝐺)‘𝑦) = (𝐻‘𝑦))
92	90, 91	breq12d 5119	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴)) → (((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦) ↔ (𝐺‘𝑥)𝑆(𝐻‘𝑦)))
93	84, 92	mtbird 328	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴)) → ¬ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦))
94	68, 93	2falsed 379	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐴)) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
95	94	anassrs 473	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
96		isorel 7357	. . . . . . . . . . . 12 ⊢ ((𝐺 Isom 𝑅, 𝑆 (𝐶, 𝐷) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝑥𝑅𝑦 ↔ (𝐺‘𝑥)𝑆(𝐺‘𝑦)))
97	4, 96	sylan 592	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝑥𝑅𝑦 ↔ (𝐺‘𝑥)𝑆(𝐺‘𝑦)))
98	89	adantrr 730	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → ((𝐻 ∪ 𝐺)‘𝑥) = (𝐺‘𝑥))
99	59	adantrl 729	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → ((𝐻 ∪ 𝐺)‘𝑦) = (𝐺‘𝑦))
100	98, 99	breq12d 5119	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦) ↔ (𝐺‘𝑥)𝑆(𝐺‘𝑦)))
101	97, 100	bitr4d 285	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
102	101	anassrs 473	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ 𝐶) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
103	95, 102	jaodan 972	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐶)) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
104	12, 103	sylan2b 606	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ (𝐴 ∪ 𝐶)) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
105	104	ex 418	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑦 ∈ (𝐴 ∪ 𝐶) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦))))
106	66, 105	jaodan 972	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐶)) → (𝑦 ∈ (𝐴 ∪ 𝐶) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦))))
107	11, 106	sylan2b 606	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ 𝐶)) → (𝑦 ∈ (𝐴 ∪ 𝐶) → (𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦))))
108	107	ralrimiv 3157	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ 𝐶)) → ∀𝑦 ∈ (𝐴 ∪ 𝐶)(𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
109	108	ralrimiva 3158	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴 ∪ 𝐶)∀𝑦 ∈ (𝐴 ∪ 𝐶)(𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦)))
110		df-isom 6567	. 2 ⊢ ((𝐻 ∪ 𝐺) Isom 𝑅, 𝑆 ((𝐴 ∪ 𝐶), (𝐵 ∪ 𝐷)) ↔ ((𝐻 ∪ 𝐺):(𝐴 ∪ 𝐶)⟶1-1onto(𝐵 ∪ 𝐷) ∧ ∀𝑥 ∈ (𝐴 ∪ 𝐶)∀𝑦 ∈ (𝐴 ∪ 𝐶)(𝑥𝑅𝑦 ↔ ((𝐻 ∪ 𝐺)‘𝑥)𝑆((𝐻 ∪ 𝐺)‘𝑦))))
111	10, 109, 110	sylanbrc 595	1 ⊢ (𝜑 → (𝐻 ∪ 𝐺) Isom 𝑅, 𝑆 ((𝐴 ∪ 𝐶), (𝐵 ∪ 𝐷)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ∩ cin 4092   ∪ cun 4152  ∅c0 4281   class class class wbr 5106   Fn wfn 6553  ⟶wf 6554  ⟶1-1ontowf1o 6557  ‘cfv 6558   Isom wiso 6559

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-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-isom 6567

This theorem is used by: (None)