Theorem isocnv3 7203

Description: Complementation law for isomorphism. (Contributed by Mario Carneiro, 9-Sep-2015.)

Hypotheses

Ref	Expression
isocnv3.1	⊢ 𝐶 = ((𝐴 × 𝐴) ∖ 𝑅)
isocnv3.2	⊢ 𝐷 = ((𝐵 × 𝐵) ∖ 𝑆)

Assertion

Ref	Expression
isocnv3	⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝐶, 𝐷 (𝐴, 𝐵))

Proof of Theorem isocnv3

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		notbi 319	. . . . 5 ⊢ ((𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ (¬ 𝑥𝑅𝑦 ↔ ¬ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))
2		brxp 5636	. . . . . . . 8 ⊢ (𝑥(𝐴 × 𝐴)𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴))
3		isocnv3.1	. . . . . . . . . . 11 ⊢ 𝐶 = ((𝐴 × 𝐴) ∖ 𝑅)
4	3	breqi 5080	. . . . . . . . . 10 ⊢ (𝑥𝐶𝑦 ↔ 𝑥((𝐴 × 𝐴) ∖ 𝑅)𝑦)
5		brdif 5127	. . . . . . . . . 10 ⊢ (𝑥((𝐴 × 𝐴) ∖ 𝑅)𝑦 ↔ (𝑥(𝐴 × 𝐴)𝑦 ∧ ¬ 𝑥𝑅𝑦))
6	4, 5	bitri 274	. . . . . . . . 9 ⊢ (𝑥𝐶𝑦 ↔ (𝑥(𝐴 × 𝐴)𝑦 ∧ ¬ 𝑥𝑅𝑦))
7	6	baib 536	. . . . . . . 8 ⊢ (𝑥(𝐴 × 𝐴)𝑦 → (𝑥𝐶𝑦 ↔ ¬ 𝑥𝑅𝑦))
8	2, 7	sylbir 234	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝐶𝑦 ↔ ¬ 𝑥𝑅𝑦))
9	8	adantl 482	. . . . . 6 ⊢ ((𝐻:𝐴–1-1-onto→𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥𝐶𝑦 ↔ ¬ 𝑥𝑅𝑦))
10		f1of 6716	. . . . . . . 8 ⊢ (𝐻:𝐴–1-1-onto→𝐵 → 𝐻:𝐴⟶𝐵)
11		ffvelrn 6959	. . . . . . . . . 10 ⊢ ((𝐻:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐻‘𝑥) ∈ 𝐵)
12		ffvelrn 6959	. . . . . . . . . 10 ⊢ ((𝐻:𝐴⟶𝐵 ∧ 𝑦 ∈ 𝐴) → (𝐻‘𝑦) ∈ 𝐵)
13	11, 12	anim12dan 619	. . . . . . . . 9 ⊢ ((𝐻:𝐴⟶𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐻‘𝑥) ∈ 𝐵 ∧ (𝐻‘𝑦) ∈ 𝐵))
14		brxp 5636	. . . . . . . . 9 ⊢ ((𝐻‘𝑥)(𝐵 × 𝐵)(𝐻‘𝑦) ↔ ((𝐻‘𝑥) ∈ 𝐵 ∧ (𝐻‘𝑦) ∈ 𝐵))
15	13, 14	sylibr 233	. . . . . . . 8 ⊢ ((𝐻:𝐴⟶𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝐻‘𝑥)(𝐵 × 𝐵)(𝐻‘𝑦))
16	10, 15	sylan 580	. . . . . . 7 ⊢ ((𝐻:𝐴–1-1-onto→𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝐻‘𝑥)(𝐵 × 𝐵)(𝐻‘𝑦))
17		isocnv3.2	. . . . . . . . . 10 ⊢ 𝐷 = ((𝐵 × 𝐵) ∖ 𝑆)
18	17	breqi 5080	. . . . . . . . 9 ⊢ ((𝐻‘𝑥)𝐷(𝐻‘𝑦) ↔ (𝐻‘𝑥)((𝐵 × 𝐵) ∖ 𝑆)(𝐻‘𝑦))
19		brdif 5127	. . . . . . . . 9 ⊢ ((𝐻‘𝑥)((𝐵 × 𝐵) ∖ 𝑆)(𝐻‘𝑦) ↔ ((𝐻‘𝑥)(𝐵 × 𝐵)(𝐻‘𝑦) ∧ ¬ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))
20	18, 19	bitri 274	. . . . . . . 8 ⊢ ((𝐻‘𝑥)𝐷(𝐻‘𝑦) ↔ ((𝐻‘𝑥)(𝐵 × 𝐵)(𝐻‘𝑦) ∧ ¬ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))
21	20	baib 536	. . . . . . 7 ⊢ ((𝐻‘𝑥)(𝐵 × 𝐵)(𝐻‘𝑦) → ((𝐻‘𝑥)𝐷(𝐻‘𝑦) ↔ ¬ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))
22	16, 21	syl 17	. . . . . 6 ⊢ ((𝐻:𝐴–1-1-onto→𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐻‘𝑥)𝐷(𝐻‘𝑦) ↔ ¬ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))
23	9, 22	bibi12d 346	. . . . 5 ⊢ ((𝐻:𝐴–1-1-onto→𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑥𝐶𝑦 ↔ (𝐻‘𝑥)𝐷(𝐻‘𝑦)) ↔ (¬ 𝑥𝑅𝑦 ↔ ¬ (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
24	1, 23	bitr4id 290	. . . 4 ⊢ ((𝐻:𝐴–1-1-onto→𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ (𝑥𝐶𝑦 ↔ (𝐻‘𝑥)𝐷(𝐻‘𝑦))))
25	24	2ralbidva 3128	. . 3 ⊢ (𝐻:𝐴–1-1-onto→𝐵 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝐶𝑦 ↔ (𝐻‘𝑥)𝐷(𝐻‘𝑦))))
26	25	pm5.32i 575	. 2 ⊢ ((𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝐶𝑦 ↔ (𝐻‘𝑥)𝐷(𝐻‘𝑦))))
27		df-isom 6442	. 2 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
28		df-isom 6442	. 2 ⊢ (𝐻 Isom 𝐶, 𝐷 (𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝐶𝑦 ↔ (𝐻‘𝑥)𝐷(𝐻‘𝑦))))
29	26, 27, 28	3bitr4i 303	1 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝐶, 𝐷 (𝐴, 𝐵))

Syntax hints:  ¬ wn 3   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∀wral 3064   ∖ cdif 3884   class class class wbr 5074   × cxp 5587  ⟶wf 6429  –1-1-onto→wf1o 6432  ‘cfv 6433   Isom wiso 6434

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-f1o 6440  df-fv 6441  df-isom 6442

This theorem is referenced by:  leiso  14173  gtiso  31033