Theorem isoini 7372

Description: Isomorphisms preserve initial segments. Proposition 6.31(2) of [TakeutiZaring] p. 33. (Contributed by NM, 20-Apr-2004.)

Assertion

Ref	Expression
isoini	⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → (𝐻 “ (𝐴 ∩ (◡𝑅 “ {𝐷}))) = (𝐵 ∩ (◡𝑆 “ {(𝐻‘𝐷)})))

Proof of Theorem isoini

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

Step	Hyp	Ref	Expression
1		dfima2 6071	. 2 ⊢ (𝐻 “ (𝐴 ∩ (◡𝑅 “ {𝐷}))) = {𝑦 ∣ ∃𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷}))𝑥𝐻𝑦}
2		elin 4096	. . . 4 ⊢ (𝑦 ∈ (𝐵 ∩ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)})))
3		isof1o 7357	. . . . . . . . 9 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻:𝐴⟶1-1onto𝐵)
4		f1ofo 6857	. . . . . . . . 9 ⊢ (𝐻:𝐴⟶1-1onto𝐵 → 𝐻:𝐴⟶onto𝐵)
5		forn 6824	. . . . . . . . . 10 ⊢ (𝐻:𝐴⟶onto𝐵 → ran 𝐻 = 𝐵)
6	5	eleq2d 2850	. . . . . . . . 9 ⊢ (𝐻:𝐴⟶onto𝐵 → (𝑦 ∈ ran 𝐻 ↔ 𝑦 ∈ 𝐵))
7	3, 4, 6	3syl 19	. . . . . . . 8 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑦 ∈ ran 𝐻 ↔ 𝑦 ∈ 𝐵))
8		f1ofn 6850	. . . . . . . . 9 ⊢ (𝐻:𝐴⟶1-1onto𝐵 → 𝐻 Fn 𝐴)
9		fvelrnb 6971	. . . . . . . . 9 ⊢ (𝐻 Fn 𝐴 → (𝑦 ∈ ran 𝐻 ↔ ∃𝑥 ∈ 𝐴 (𝐻‘𝑥) = 𝑦))
10	3, 8, 9	3syl 19	. . . . . . . 8 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑦 ∈ ran 𝐻 ↔ ∃𝑥 ∈ 𝐴 (𝐻‘𝑥) = 𝑦))
11	7, 10	bitr3d 284	. . . . . . 7 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑦 ∈ 𝐵 ↔ ∃𝑥 ∈ 𝐴 (𝐻‘𝑥) = 𝑦))
12		fvex 6924	. . . . . . . 8 ⊢ (𝐻‘𝐷) ∈ V
13		vex 3458	. . . . . . . . 9 ⊢ 𝑦 ∈ V
14	13	eliniseg 6105	. . . . . . . 8 ⊢ ((𝐻‘𝐷) ∈ V → (𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)}) ↔ 𝑦𝑆(𝐻‘𝐷)))
15	12, 14	mp1i 14	. . . . . . 7 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)}) ↔ 𝑦𝑆(𝐻‘𝐷)))
16	11, 15	anbi12d 644	. . . . . 6 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → ((𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ (∃𝑥 ∈ 𝐴 (𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))
17	16	adantr 486	. . . . 5 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → ((𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ (∃𝑥 ∈ 𝐴 (𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))
18		elin 4096	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷})) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})))
19		vex 3458	. . . . . . . . . . . . . 14 ⊢ 𝑥 ∈ V
20	19	eliniseg 6105	. . . . . . . . . . . . 13 ⊢ (𝐷 ∈ 𝐴 → (𝑥 ∈ (◡𝑅 “ {𝐷}) ↔ 𝑥𝑅𝐷))
21	20	anbi2d 642	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝐷)))
22	18, 21	bitrid 286	. . . . . . . . . . 11 ⊢ (𝐷 ∈ 𝐴 → (𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷})) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝐷)))
23	22	anbi1d 643	. . . . . . . . . 10 ⊢ (𝐷 ∈ 𝐴 → ((𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷})) ∧ 𝑥𝐻𝑦) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝐷) ∧ 𝑥𝐻𝑦)))
24		anass 474	. . . . . . . . . 10 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝐷) ∧ 𝑥𝐻𝑦) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥𝑅𝐷 ∧ 𝑥𝐻𝑦)))
25	23, 24	bitrdi 290	. . . . . . . . 9 ⊢ (𝐷 ∈ 𝐴 → ((𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷})) ∧ 𝑥𝐻𝑦) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥𝑅𝐷 ∧ 𝑥𝐻𝑦))))
26	25	adantl 487	. . . . . . . 8 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → ((𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷})) ∧ 𝑥𝐻𝑦) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥𝑅𝐷 ∧ 𝑥𝐻𝑦))))
27		isorel 7360	. . . . . . . . . . . . . 14 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥𝑅𝐷 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝐷)))
28	3, 8	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻 Fn 𝐴)
29		fnbrfvb 6961	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐻 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐻‘𝑥) = 𝑦 ↔ 𝑥𝐻𝑦))
30	29	bicomd 226	. . . . . . . . . . . . . . . 16 ⊢ ((𝐻 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑥𝐻𝑦 ↔ (𝐻‘𝑥) = 𝑦))
31	28, 30	sylan 592	. . . . . . . . . . . . . . 15 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑥 ∈ 𝐴) → (𝑥𝐻𝑦 ↔ (𝐻‘𝑥) = 𝑦))
32	31	adantrr 730	. . . . . . . . . . . . . 14 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥𝐻𝑦 ↔ (𝐻‘𝑥) = 𝑦))
33	27, 32	anbi12d 644	. . . . . . . . . . . . 13 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝑥𝑅𝐷 ∧ 𝑥𝐻𝑦) ↔ ((𝐻‘𝑥)𝑆(𝐻‘𝐷) ∧ (𝐻‘𝑥) = 𝑦)))
34		ancom 466	. . . . . . . . . . . . . 14 ⊢ (((𝐻‘𝑥)𝑆(𝐻‘𝐷) ∧ (𝐻‘𝑥) = 𝑦) ↔ ((𝐻‘𝑥) = 𝑦 ∧ (𝐻‘𝑥)𝑆(𝐻‘𝐷)))
35		breq1 5109	. . . . . . . . . . . . . . 15 ⊢ ((𝐻‘𝑥) = 𝑦 → ((𝐻‘𝑥)𝑆(𝐻‘𝐷) ↔ 𝑦𝑆(𝐻‘𝐷)))
36	35	pm5.32i 585	. . . . . . . . . . . . . 14 ⊢ (((𝐻‘𝑥) = 𝑦 ∧ (𝐻‘𝑥)𝑆(𝐻‘𝐷)) ↔ ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)))
37	34, 36	bitri 278	. . . . . . . . . . . . 13 ⊢ (((𝐻‘𝑥)𝑆(𝐻‘𝐷) ∧ (𝐻‘𝑥) = 𝑦) ↔ ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)))
38	33, 37	bitrdi 290	. . . . . . . . . . . 12 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝑥𝑅𝐷 ∧ 𝑥𝐻𝑦) ↔ ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))
39	38	exp32 426	. . . . . . . . . . 11 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑥 ∈ 𝐴 → (𝐷 ∈ 𝐴 → ((𝑥𝑅𝐷 ∧ 𝑥𝐻𝑦) ↔ ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))))
40	39	com23 87	. . . . . . . . . 10 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐷 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝑥𝑅𝐷 ∧ 𝑥𝐻𝑦) ↔ ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))))
41	40	imp 412	. . . . . . . . 9 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → (𝑥 ∈ 𝐴 → ((𝑥𝑅𝐷 ∧ 𝑥𝐻𝑦) ↔ ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)))))
42	41	pm5.32d 588	. . . . . . . 8 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ∧ (𝑥𝑅𝐷 ∧ 𝑥𝐻𝑦)) ↔ (𝑥 ∈ 𝐴 ∧ ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)))))
43	26, 42	bitrd 282	. . . . . . 7 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → ((𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷})) ∧ 𝑥𝐻𝑦) ↔ (𝑥 ∈ 𝐴 ∧ ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)))))
44	43	rexbidv2 3186	. . . . . 6 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → (∃𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷}))𝑥𝐻𝑦 ↔ ∃𝑥 ∈ 𝐴 ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))
45		r19.41v 3196	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) ↔ (∃𝑥 ∈ 𝐴 (𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)))
46	44, 45	bitrdi 290	. . . . 5 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → (∃𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷}))𝑥𝐻𝑦 ↔ (∃𝑥 ∈ 𝐴 (𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))
47	17, 46	bitr4d 285	. . . 4 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → ((𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ ∃𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷}))𝑥𝐻𝑦))
48	2, 47	bitrid 286	. . 3 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → (𝑦 ∈ (𝐵 ∩ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ ∃𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷}))𝑥𝐻𝑦))
49	48	eqabdv 2897	. 2 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → (𝐵 ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = {𝑦 ∣ ∃𝑥 ∈ (𝐴 ∩ (◡𝑅 “ {𝐷}))𝑥𝐻𝑦})
50	1, 49	eqtr4id 2817	1 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷 ∈ 𝐴) → (𝐻 “ (𝐴 ∩ (◡𝑅 “ {𝐷}))) = (𝐵 ∩ (◡𝑆 “ {(𝐻‘𝐷)})))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741  ∃wrex 3090  Vcvv 3454   ∩ cin 4092  {csn 4588   class class class wbr 5106  ^◡ccnv 5655  ran crn 5657   “ cima 5659   Fn wfn 6556  ⟶ontowfo 6559  ⟶1-1ontowf1o 6560  ‘cfv 6561   Isom wiso 6562

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-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396

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-nfc 2913  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 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-isom 6570

This theorem is used by:  isoini2  7373  isoselem  7375  infxpenlem  10122