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

Theorem fprg 7083
Description: A function with a domain of two elements. (Contributed by FL, 2-Feb-2014.)
Assertion
Ref Expression
fprg (((𝐴𝐸𝐵𝐹) ∧ (𝐶𝐺𝐷𝐻) ∧ 𝐴𝐵) → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}⟶{𝐶, 𝐷})

Proof of Theorem fprg
StepHypRef Expression
1 elex 3459 . . . 4 (𝐴𝐸𝐴 ∈ V)
2 elex 3459 . . . 4 (𝐵𝐹𝐵 ∈ V)
31, 2anim12i 613 . . 3 ((𝐴𝐸𝐵𝐹) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
4 elex 3459 . . . 4 (𝐶𝐺𝐶 ∈ V)
5 elex 3459 . . . 4 (𝐷𝐻𝐷 ∈ V)
64, 5anim12i 613 . . 3 ((𝐶𝐺𝐷𝐻) → (𝐶 ∈ V ∧ 𝐷 ∈ V))
7 neeq1 3003 . . . . 5 (𝐴 = if(𝐴 ∈ V, 𝐴, ∅) → (𝐴𝐵 ↔ if(𝐴 ∈ V, 𝐴, ∅) ≠ 𝐵))
8 opeq1 4817 . . . . . . 7 (𝐴 = if(𝐴 ∈ V, 𝐴, ∅) → ⟨𝐴, 𝐶⟩ = ⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩)
98preq1d 4687 . . . . . 6 (𝐴 = if(𝐴 ∈ V, 𝐴, ∅) → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = {⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨𝐵, 𝐷⟩})
10 preq1 4681 . . . . . 6 (𝐴 = if(𝐴 ∈ V, 𝐴, ∅) → {𝐴, 𝐵} = {if(𝐴 ∈ V, 𝐴, ∅), 𝐵})
119, 10feq12d 6639 . . . . 5 (𝐴 = if(𝐴 ∈ V, 𝐴, ∅) → ({⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}⟶{𝐶, 𝐷} ↔ {⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨𝐵, 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), 𝐵}⟶{𝐶, 𝐷}))
127, 11imbi12d 344 . . . 4 (𝐴 = if(𝐴 ∈ V, 𝐴, ∅) → ((𝐴𝐵 → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}⟶{𝐶, 𝐷}) ↔ (if(𝐴 ∈ V, 𝐴, ∅) ≠ 𝐵 → {⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨𝐵, 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), 𝐵}⟶{𝐶, 𝐷})))
13 neeq2 3004 . . . . 5 (𝐵 = if(𝐵 ∈ V, 𝐵, ∅) → (if(𝐴 ∈ V, 𝐴, ∅) ≠ 𝐵 ↔ if(𝐴 ∈ V, 𝐴, ∅) ≠ if(𝐵 ∈ V, 𝐵, ∅)))
14 opeq1 4817 . . . . . . 7 (𝐵 = if(𝐵 ∈ V, 𝐵, ∅) → ⟨𝐵, 𝐷⟩ = ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩)
1514preq2d 4688 . . . . . 6 (𝐵 = if(𝐵 ∈ V, 𝐵, ∅) → {⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨𝐵, 𝐷⟩} = {⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩})
16 preq2 4682 . . . . . 6 (𝐵 = if(𝐵 ∈ V, 𝐵, ∅) → {if(𝐴 ∈ V, 𝐴, ∅), 𝐵} = {if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)})
1715, 16feq12d 6639 . . . . 5 (𝐵 = if(𝐵 ∈ V, 𝐵, ∅) → ({⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨𝐵, 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), 𝐵}⟶{𝐶, 𝐷} ↔ {⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)}⟶{𝐶, 𝐷}))
1813, 17imbi12d 344 . . . 4 (𝐵 = if(𝐵 ∈ V, 𝐵, ∅) → ((if(𝐴 ∈ V, 𝐴, ∅) ≠ 𝐵 → {⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨𝐵, 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), 𝐵}⟶{𝐶, 𝐷}) ↔ (if(𝐴 ∈ V, 𝐴, ∅) ≠ if(𝐵 ∈ V, 𝐵, ∅) → {⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)}⟶{𝐶, 𝐷})))
19 opeq2 4818 . . . . . . 7 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → ⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩ = ⟨if(𝐴 ∈ V, 𝐴, ∅), if(𝐶 ∈ V, 𝐶, ∅)⟩)
2019preq1d 4687 . . . . . 6 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → {⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩} = {⟨if(𝐴 ∈ V, 𝐴, ∅), if(𝐶 ∈ V, 𝐶, ∅)⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩})
21 eqidd 2737 . . . . . 6 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → {if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)} = {if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)})
22 preq1 4681 . . . . . 6 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → {𝐶, 𝐷} = {if(𝐶 ∈ V, 𝐶, ∅), 𝐷})
2320, 21, 22feq123d 6640 . . . . 5 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → ({⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)}⟶{𝐶, 𝐷} ↔ {⟨if(𝐴 ∈ V, 𝐴, ∅), if(𝐶 ∈ V, 𝐶, ∅)⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)}⟶{if(𝐶 ∈ V, 𝐶, ∅), 𝐷}))
2423imbi2d 340 . . . 4 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → ((if(𝐴 ∈ V, 𝐴, ∅) ≠ if(𝐵 ∈ V, 𝐵, ∅) → {⟨if(𝐴 ∈ V, 𝐴, ∅), 𝐶⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)}⟶{𝐶, 𝐷}) ↔ (if(𝐴 ∈ V, 𝐴, ∅) ≠ if(𝐵 ∈ V, 𝐵, ∅) → {⟨if(𝐴 ∈ V, 𝐴, ∅), if(𝐶 ∈ V, 𝐶, ∅)⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)}⟶{if(𝐶 ∈ V, 𝐶, ∅), 𝐷})))
25 opeq2 4818 . . . . . . 7 (𝐷 = if(𝐷 ∈ V, 𝐷, ∅) → ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩ = ⟨if(𝐵 ∈ V, 𝐵, ∅), if(𝐷 ∈ V, 𝐷, ∅)⟩)
2625preq2d 4688 . . . . . 6 (𝐷 = if(𝐷 ∈ V, 𝐷, ∅) → {⟨if(𝐴 ∈ V, 𝐴, ∅), if(𝐶 ∈ V, 𝐶, ∅)⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩} = {⟨if(𝐴 ∈ V, 𝐴, ∅), if(𝐶 ∈ V, 𝐶, ∅)⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), if(𝐷 ∈ V, 𝐷, ∅)⟩})
27 eqidd 2737 . . . . . 6 (𝐷 = if(𝐷 ∈ V, 𝐷, ∅) → {if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)} = {if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)})
28 preq2 4682 . . . . . 6 (𝐷 = if(𝐷 ∈ V, 𝐷, ∅) → {if(𝐶 ∈ V, 𝐶, ∅), 𝐷} = {if(𝐶 ∈ V, 𝐶, ∅), if(𝐷 ∈ V, 𝐷, ∅)})
2926, 27, 28feq123d 6640 . . . . 5 (𝐷 = if(𝐷 ∈ V, 𝐷, ∅) → ({⟨if(𝐴 ∈ V, 𝐴, ∅), if(𝐶 ∈ V, 𝐶, ∅)⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)}⟶{if(𝐶 ∈ V, 𝐶, ∅), 𝐷} ↔ {⟨if(𝐴 ∈ V, 𝐴, ∅), if(𝐶 ∈ V, 𝐶, ∅)⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), if(𝐷 ∈ V, 𝐷, ∅)⟩}:{if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)}⟶{if(𝐶 ∈ V, 𝐶, ∅), if(𝐷 ∈ V, 𝐷, ∅)}))
3029imbi2d 340 . . . 4 (𝐷 = if(𝐷 ∈ V, 𝐷, ∅) → ((if(𝐴 ∈ V, 𝐴, ∅) ≠ if(𝐵 ∈ V, 𝐵, ∅) → {⟨if(𝐴 ∈ V, 𝐴, ∅), if(𝐶 ∈ V, 𝐶, ∅)⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), 𝐷⟩}:{if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)}⟶{if(𝐶 ∈ V, 𝐶, ∅), 𝐷}) ↔ (if(𝐴 ∈ V, 𝐴, ∅) ≠ if(𝐵 ∈ V, 𝐵, ∅) → {⟨if(𝐴 ∈ V, 𝐴, ∅), if(𝐶 ∈ V, 𝐶, ∅)⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), if(𝐷 ∈ V, 𝐷, ∅)⟩}:{if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)}⟶{if(𝐶 ∈ V, 𝐶, ∅), if(𝐷 ∈ V, 𝐷, ∅)})))
31 0ex 5251 . . . . . 6 ∅ ∈ V
3231elimel 4542 . . . . 5 if(𝐴 ∈ V, 𝐴, ∅) ∈ V
3331elimel 4542 . . . . 5 if(𝐵 ∈ V, 𝐵, ∅) ∈ V
3431elimel 4542 . . . . 5 if(𝐶 ∈ V, 𝐶, ∅) ∈ V
3531elimel 4542 . . . . 5 if(𝐷 ∈ V, 𝐷, ∅) ∈ V
3632, 33, 34, 35fpr 7082 . . . 4 (if(𝐴 ∈ V, 𝐴, ∅) ≠ if(𝐵 ∈ V, 𝐵, ∅) → {⟨if(𝐴 ∈ V, 𝐴, ∅), if(𝐶 ∈ V, 𝐶, ∅)⟩, ⟨if(𝐵 ∈ V, 𝐵, ∅), if(𝐷 ∈ V, 𝐷, ∅)⟩}:{if(𝐴 ∈ V, 𝐴, ∅), if(𝐵 ∈ V, 𝐵, ∅)}⟶{if(𝐶 ∈ V, 𝐶, ∅), if(𝐷 ∈ V, 𝐷, ∅)})
3712, 18, 24, 30, 36dedth4h 4534 . . 3 (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → (𝐴𝐵 → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}⟶{𝐶, 𝐷}))
383, 6, 37syl2an 596 . 2 (((𝐴𝐸𝐵𝐹) ∧ (𝐶𝐺𝐷𝐻)) → (𝐴𝐵 → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}⟶{𝐶, 𝐷}))
39383impia 1116 1 (((𝐴𝐸𝐵𝐹) ∧ (𝐶𝐺𝐷𝐻) ∧ 𝐴𝐵) → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}⟶{𝐶, 𝐷})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1086   = wceq 1540  wcel 2105  wne 2940  Vcvv 3441  c0 4269  ifcif 4473  {cpr 4575  cop 4579  wf 6475
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-12 2170  ax-ext 2707  ax-sep 5243  ax-nul 5250  ax-pr 5372
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-clab 2714  df-cleq 2728  df-clel 2814  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3404  df-v 3443  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4270  df-if 4474  df-sn 4574  df-pr 4576  df-op 4580  df-br 5093  df-opab 5155  df-id 5518  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-fun 6481  df-fn 6482  df-f 6483
This theorem is referenced by:  ftpg  7084  fpropnf1  7196  wrdlen2i  14754  umgr2v2e  28181  linds2eq  31872  fprmappr  46040  zlmodzxzel  46050  ldepspr  46173  zlmodzxzldeplem1  46200  2arymaptfo  46359  prelrrx2  46418  line2  46457  line2x  46459  line2y  46460
  Copyright terms: Public domain W3C validator