Theorem isocnv2 5953

Description: Converse law for isomorphism. (Contributed by Mario Carneiro, 30-Jan-2014.)

Assertion

Ref	Expression
isocnv2	⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom ◡𝑅, ◡𝑆(𝐴, 𝐵))

Proof of Theorem isocnv2

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

Step	Hyp	Ref	Expression
1		isof1o 5948	. . 3 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻:𝐴–1-1-onto→𝐵)
2		f1ofn 5584	. . 3 ⊢ (𝐻:𝐴–1-1-onto→𝐵 → 𝐻 Fn 𝐴)
3	1, 2	syl 14	. 2 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻 Fn 𝐴)
4		isof1o 5948	. . 3 ⊢ (𝐻 Isom ◡𝑅, ◡𝑆(𝐴, 𝐵) → 𝐻:𝐴–1-1-onto→𝐵)
5	4, 2	syl 14	. 2 ⊢ (𝐻 Isom ◡𝑅, ◡𝑆(𝐴, 𝐵) → 𝐻 Fn 𝐴)
6		ralcom 2696	. . . . 5 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝑦𝑅𝑥 ↔ (𝐻‘𝑦)𝑆(𝐻‘𝑥)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 ↔ (𝐻‘𝑦)𝑆(𝐻‘𝑥)))
7		vex 2805	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
8		vex 2805	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
9	7, 8	brcnv 4913	. . . . . . . . 9 ⊢ (𝑥◡𝑅𝑦 ↔ 𝑦𝑅𝑥)
10	9	a1i 9	. . . . . . . 8 ⊢ (((𝐻 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝑥◡𝑅𝑦 ↔ 𝑦𝑅𝑥))
11		funfvex 5656	. . . . . . . . . . 11 ⊢ ((Fun 𝐻 ∧ 𝑥 ∈ dom 𝐻) → (𝐻‘𝑥) ∈ V)
12	11	funfni 5432	. . . . . . . . . 10 ⊢ ((𝐻 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐻‘𝑥) ∈ V)
13	12	adantr 276	. . . . . . . . 9 ⊢ (((𝐻 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝐻‘𝑥) ∈ V)
14		funfvex 5656	. . . . . . . . . . 11 ⊢ ((Fun 𝐻 ∧ 𝑦 ∈ dom 𝐻) → (𝐻‘𝑦) ∈ V)
15	14	funfni 5432	. . . . . . . . . 10 ⊢ ((𝐻 Fn 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝐻‘𝑦) ∈ V)
16	15	adantlr 477	. . . . . . . . 9 ⊢ (((𝐻 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝐻‘𝑦) ∈ V)
17		brcnvg 4911	. . . . . . . . 9 ⊢ (((𝐻‘𝑥) ∈ V ∧ (𝐻‘𝑦) ∈ V) → ((𝐻‘𝑥)◡𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑦)𝑆(𝐻‘𝑥)))
18	13, 16, 17	syl2anc 411	. . . . . . . 8 ⊢ (((𝐻 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝐻‘𝑥)◡𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑦)𝑆(𝐻‘𝑥)))
19	10, 18	bibi12d 235	. . . . . . 7 ⊢ (((𝐻 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝑥◡𝑅𝑦 ↔ (𝐻‘𝑥)◡𝑆(𝐻‘𝑦)) ↔ (𝑦𝑅𝑥 ↔ (𝐻‘𝑦)𝑆(𝐻‘𝑥))))
20	19	ralbidva 2528	. . . . . 6 ⊢ ((𝐻 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 (𝑥◡𝑅𝑦 ↔ (𝐻‘𝑥)◡𝑆(𝐻‘𝑦)) ↔ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 ↔ (𝐻‘𝑦)𝑆(𝐻‘𝑥))))
21	20	ralbidva 2528	. . . . 5 ⊢ (𝐻 Fn 𝐴 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥◡𝑅𝑦 ↔ (𝐻‘𝑥)◡𝑆(𝐻‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 ↔ (𝐻‘𝑦)𝑆(𝐻‘𝑥))))
22	6, 21	bitr4id 199	. . . 4 ⊢ (𝐻 Fn 𝐴 → (∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝑦𝑅𝑥 ↔ (𝐻‘𝑦)𝑆(𝐻‘𝑥)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥◡𝑅𝑦 ↔ (𝐻‘𝑥)◡𝑆(𝐻‘𝑦))))
23	22	anbi2d 464	. . 3 ⊢ (𝐻 Fn 𝐴 → ((𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝑦𝑅𝑥 ↔ (𝐻‘𝑦)𝑆(𝐻‘𝑥))) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥◡𝑅𝑦 ↔ (𝐻‘𝑥)◡𝑆(𝐻‘𝑦)))))
24		df-isom 5335	. . 3 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝑦𝑅𝑥 ↔ (𝐻‘𝑦)𝑆(𝐻‘𝑥))))
25		df-isom 5335	. . 3 ⊢ (𝐻 Isom ◡𝑅, ◡𝑆(𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥◡𝑅𝑦 ↔ (𝐻‘𝑥)◡𝑆(𝐻‘𝑦))))
26	23, 24, 25	3bitr4g 223	. 2 ⊢ (𝐻 Fn 𝐴 → (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom ◡𝑅, ◡𝑆(𝐴, 𝐵)))
27	3, 5, 26	pm5.21nii 711	1 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom ◡𝑅, ◡𝑆(𝐴, 𝐵))

Syntax hints:   ∧ wa 104   ↔ wb 105   ∈ wcel 2202  ∀wral 2510  Vcvv 2802   class class class wbr 4088  ^◡ccnv 4724   Fn wfn 5321  –1-1-onto→wf1o 5325  ‘cfv 5326   Isom wiso 5327

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-f1o 5333  df-fv 5334  df-isom 5335

This theorem is referenced by:  infisoti  7231