MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isoini Structured version   Visualization version   GIF version

Theorem isoini 7347
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.
StepHypRef Expression
1 dfima2 6069 . 2 (𝐻 “ (𝐴 ∩ (𝑅 “ {𝐷}))) = {𝑦 ∣ ∃𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷}))𝑥𝐻𝑦}
2 elin 3924 . . . 4 (𝑦 ∈ (𝐵 ∩ (𝑆 “ {(𝐻𝐷)})) ↔ (𝑦𝐵𝑦 ∈ (𝑆 “ {(𝐻𝐷)})))
3 isof1o 7332 . . . . . . . . 9 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻:𝐴1-1-onto𝐵)
4 f1ofo 6835 . . . . . . . . 9 (𝐻:𝐴1-1-onto𝐵𝐻:𝐴onto𝐵)
5 forn 6802 . . . . . . . . . 10 (𝐻:𝐴onto𝐵 → ran 𝐻 = 𝐵)
65eleq2d 2852 . . . . . . . . 9 (𝐻:𝐴onto𝐵 → (𝑦 ∈ ran 𝐻𝑦𝐵))
73, 4, 63syl 19 . . . . . . . 8 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑦 ∈ ran 𝐻𝑦𝐵))
8 f1ofn 6828 . . . . . . . . 9 (𝐻:𝐴1-1-onto𝐵𝐻 Fn 𝐴)
9 fvelrnb 6948 . . . . . . . . 9 (𝐻 Fn 𝐴 → (𝑦 ∈ ran 𝐻 ↔ ∃𝑥𝐴 (𝐻𝑥) = 𝑦))
103, 8, 93syl 19 . . . . . . . 8 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑦 ∈ ran 𝐻 ↔ ∃𝑥𝐴 (𝐻𝑥) = 𝑦))
117, 10bitr3d 284 . . . . . . 7 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑦𝐵 ↔ ∃𝑥𝐴 (𝐻𝑥) = 𝑦))
12 fvex 6901 . . . . . . . 8 (𝐻𝐷) ∈ V
13 vex 3462 . . . . . . . . 9 𝑦 ∈ V
1413eliniseg 6101 . . . . . . . 8 ((𝐻𝐷) ∈ V → (𝑦 ∈ (𝑆 “ {(𝐻𝐷)}) ↔ 𝑦𝑆(𝐻𝐷)))
1512, 14mp1i 14 . . . . . . 7 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑦 ∈ (𝑆 “ {(𝐻𝐷)}) ↔ 𝑦𝑆(𝐻𝐷)))
1611, 15anbi12d 644 . . . . . 6 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → ((𝑦𝐵𝑦 ∈ (𝑆 “ {(𝐻𝐷)})) ↔ (∃𝑥𝐴 (𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷))))
1716adantr 486 . . . . 5 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷𝐴) → ((𝑦𝐵𝑦 ∈ (𝑆 “ {(𝐻𝐷)})) ↔ (∃𝑥𝐴 (𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷))))
18 elin 3924 . . . . . . . . . . . 12 (𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷})) ↔ (𝑥𝐴𝑥 ∈ (𝑅 “ {𝐷})))
19 vex 3462 . . . . . . . . . . . . . 14 𝑥 ∈ V
2019eliniseg 6101 . . . . . . . . . . . . 13 (𝐷𝐴 → (𝑥 ∈ (𝑅 “ {𝐷}) ↔ 𝑥𝑅𝐷))
2120anbi2d 642 . . . . . . . . . . . 12 (𝐷𝐴 → ((𝑥𝐴𝑥 ∈ (𝑅 “ {𝐷})) ↔ (𝑥𝐴𝑥𝑅𝐷)))
2218, 21bitrid 286 . . . . . . . . . . 11 (𝐷𝐴 → (𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷})) ↔ (𝑥𝐴𝑥𝑅𝐷)))
2322anbi1d 643 . . . . . . . . . 10 (𝐷𝐴 → ((𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷})) ∧ 𝑥𝐻𝑦) ↔ ((𝑥𝐴𝑥𝑅𝐷) ∧ 𝑥𝐻𝑦)))
24 anass 474 . . . . . . . . . 10 (((𝑥𝐴𝑥𝑅𝐷) ∧ 𝑥𝐻𝑦) ↔ (𝑥𝐴 ∧ (𝑥𝑅𝐷𝑥𝐻𝑦)))
2523, 24bitrdi 290 . . . . . . . . 9 (𝐷𝐴 → ((𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷})) ∧ 𝑥𝐻𝑦) ↔ (𝑥𝐴 ∧ (𝑥𝑅𝐷𝑥𝐻𝑦))))
2625adantl 487 . . . . . . . 8 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷𝐴) → ((𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷})) ∧ 𝑥𝐻𝑦) ↔ (𝑥𝐴 ∧ (𝑥𝑅𝐷𝑥𝐻𝑦))))
27 isorel 7335 . . . . . . . . . . . . . 14 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥𝐴𝐷𝐴)) → (𝑥𝑅𝐷 ↔ (𝐻𝑥)𝑆(𝐻𝐷)))
283, 8syl 18 . . . . . . . . . . . . . . . 16 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻 Fn 𝐴)
29 fnbrfvb 6938 . . . . . . . . . . . . . . . . 17 ((𝐻 Fn 𝐴𝑥𝐴) → ((𝐻𝑥) = 𝑦𝑥𝐻𝑦))
3029bicomd 226 . . . . . . . . . . . . . . . 16 ((𝐻 Fn 𝐴𝑥𝐴) → (𝑥𝐻𝑦 ↔ (𝐻𝑥) = 𝑦))
3128, 30sylan 592 . . . . . . . . . . . . . . 15 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑥𝐴) → (𝑥𝐻𝑦 ↔ (𝐻𝑥) = 𝑦))
3231adantrr 730 . . . . . . . . . . . . . 14 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥𝐴𝐷𝐴)) → (𝑥𝐻𝑦 ↔ (𝐻𝑥) = 𝑦))
3327, 32anbi12d 644 . . . . . . . . . . . . 13 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥𝐴𝐷𝐴)) → ((𝑥𝑅𝐷𝑥𝐻𝑦) ↔ ((𝐻𝑥)𝑆(𝐻𝐷) ∧ (𝐻𝑥) = 𝑦)))
34 ancom 466 . . . . . . . . . . . . . 14 (((𝐻𝑥)𝑆(𝐻𝐷) ∧ (𝐻𝑥) = 𝑦) ↔ ((𝐻𝑥) = 𝑦 ∧ (𝐻𝑥)𝑆(𝐻𝐷)))
35 breq1 5117 . . . . . . . . . . . . . . 15 ((𝐻𝑥) = 𝑦 → ((𝐻𝑥)𝑆(𝐻𝐷) ↔ 𝑦𝑆(𝐻𝐷)))
3635pm5.32i 585 . . . . . . . . . . . . . 14 (((𝐻𝑥) = 𝑦 ∧ (𝐻𝑥)𝑆(𝐻𝐷)) ↔ ((𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷)))
3734, 36bitri 278 . . . . . . . . . . . . 13 (((𝐻𝑥)𝑆(𝐻𝐷) ∧ (𝐻𝑥) = 𝑦) ↔ ((𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷)))
3833, 37bitrdi 290 . . . . . . . . . . . 12 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥𝐴𝐷𝐴)) → ((𝑥𝑅𝐷𝑥𝐻𝑦) ↔ ((𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷))))
3938exp32 426 . . . . . . . . . . 11 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑥𝐴 → (𝐷𝐴 → ((𝑥𝑅𝐷𝑥𝐻𝑦) ↔ ((𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷))))))
4039com23 87 . . . . . . . . . 10 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐷𝐴 → (𝑥𝐴 → ((𝑥𝑅𝐷𝑥𝐻𝑦) ↔ ((𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷))))))
4140imp 412 . . . . . . . . 9 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷𝐴) → (𝑥𝐴 → ((𝑥𝑅𝐷𝑥𝐻𝑦) ↔ ((𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷)))))
4241pm5.32d 588 . . . . . . . 8 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷𝐴) → ((𝑥𝐴 ∧ (𝑥𝑅𝐷𝑥𝐻𝑦)) ↔ (𝑥𝐴 ∧ ((𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷)))))
4326, 42bitrd 282 . . . . . . 7 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷𝐴) → ((𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷})) ∧ 𝑥𝐻𝑦) ↔ (𝑥𝐴 ∧ ((𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷)))))
4443rexbidv2 3188 . . . . . 6 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷𝐴) → (∃𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷}))𝑥𝐻𝑦 ↔ ∃𝑥𝐴 ((𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷))))
45 r19.41v 3198 . . . . . 6 (∃𝑥𝐴 ((𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷)) ↔ (∃𝑥𝐴 (𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷)))
4644, 45bitrdi 290 . . . . 5 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷𝐴) → (∃𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷}))𝑥𝐻𝑦 ↔ (∃𝑥𝐴 (𝐻𝑥) = 𝑦𝑦𝑆(𝐻𝐷))))
4717, 46bitr4d 285 . . . 4 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷𝐴) → ((𝑦𝐵𝑦 ∈ (𝑆 “ {(𝐻𝐷)})) ↔ ∃𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷}))𝑥𝐻𝑦))
482, 47bitrid 286 . . 3 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷𝐴) → (𝑦 ∈ (𝐵 ∩ (𝑆 “ {(𝐻𝐷)})) ↔ ∃𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷}))𝑥𝐻𝑦))
4948eqabdv 2899 . 2 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷𝐴) → (𝐵 ∩ (𝑆 “ {(𝐻𝐷)})) = {𝑦 ∣ ∃𝑥 ∈ (𝐴 ∩ (𝑅 “ {𝐷}))𝑥𝐻𝑦})
501, 49eqtr4id 2820 1 ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐷𝐴) → (𝐻 “ (𝐴 ∩ (𝑅 “ {𝐷}))) = (𝐵 ∩ (𝑆 “ {(𝐻𝐷)})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  {cab 2744  wrex 3092  Vcvv 3458  cin 3907  {csn 4594   class class class wbr 5114  ccnv 5665  ran crn 5667  cima 5669   Fn wfn 6538  ontowfo 6541  1-1-ontowf1o 6542  cfv 6543   Isom wiso 6544
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409
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 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552
This theorem is used by:  isoini2  7348  isoselem  7350  infxpenlem  10016
  Copyright terms: Public domain W3C validator