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

Theorem fliftcnv 7043
Description: Converse of the relation 𝐹. (Contributed by Mario Carneiro, 23-Dec-2016.)
Hypotheses
Ref Expression
flift.1 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
flift.2 ((𝜑𝑥𝑋) → 𝐴𝑅)
flift.3 ((𝜑𝑥𝑋) → 𝐵𝑆)
Assertion
Ref Expression
fliftcnv (𝜑𝐹 = ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩))
Distinct variable groups:   𝑥,𝑅   𝜑,𝑥   𝑥,𝑋   𝑥,𝑆
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem fliftcnv
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2798 . . . . 5 ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩) = ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩)
2 flift.3 . . . . 5 ((𝜑𝑥𝑋) → 𝐵𝑆)
3 flift.2 . . . . 5 ((𝜑𝑥𝑋) → 𝐴𝑅)
41, 2, 3fliftrel 7040 . . . 4 (𝜑 → ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩) ⊆ (𝑆 × 𝑅))
5 relxp 5537 . . . 4 Rel (𝑆 × 𝑅)
6 relss 5620 . . . 4 (ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩) ⊆ (𝑆 × 𝑅) → (Rel (𝑆 × 𝑅) → Rel ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩)))
74, 5, 6mpisyl 21 . . 3 (𝜑 → Rel ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩))
8 relcnv 5934 . . 3 Rel 𝐹
97, 8jctil 523 . 2 (𝜑 → (Rel 𝐹 ∧ Rel ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩)))
10 flift.1 . . . . . . 7 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
1110, 3, 2fliftel 7041 . . . . . 6 (𝜑 → (𝑧𝐹𝑦 ↔ ∃𝑥𝑋 (𝑧 = 𝐴𝑦 = 𝐵)))
12 vex 3444 . . . . . . 7 𝑦 ∈ V
13 vex 3444 . . . . . . 7 𝑧 ∈ V
1412, 13brcnv 5717 . . . . . 6 (𝑦𝐹𝑧𝑧𝐹𝑦)
15 ancom 464 . . . . . . 7 ((𝑦 = 𝐵𝑧 = 𝐴) ↔ (𝑧 = 𝐴𝑦 = 𝐵))
1615rexbii 3210 . . . . . 6 (∃𝑥𝑋 (𝑦 = 𝐵𝑧 = 𝐴) ↔ ∃𝑥𝑋 (𝑧 = 𝐴𝑦 = 𝐵))
1711, 14, 163bitr4g 317 . . . . 5 (𝜑 → (𝑦𝐹𝑧 ↔ ∃𝑥𝑋 (𝑦 = 𝐵𝑧 = 𝐴)))
181, 2, 3fliftel 7041 . . . . 5 (𝜑 → (𝑦ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩)𝑧 ↔ ∃𝑥𝑋 (𝑦 = 𝐵𝑧 = 𝐴)))
1917, 18bitr4d 285 . . . 4 (𝜑 → (𝑦𝐹𝑧𝑦ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩)𝑧))
20 df-br 5031 . . . 4 (𝑦𝐹𝑧 ↔ ⟨𝑦, 𝑧⟩ ∈ 𝐹)
21 df-br 5031 . . . 4 (𝑦ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩)𝑧 ↔ ⟨𝑦, 𝑧⟩ ∈ ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩))
2219, 20, 213bitr3g 316 . . 3 (𝜑 → (⟨𝑦, 𝑧⟩ ∈ 𝐹 ↔ ⟨𝑦, 𝑧⟩ ∈ ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩)))
2322eqrelrdv2 5632 . 2 (((Rel 𝐹 ∧ Rel ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩)) ∧ 𝜑) → 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩))
249, 23mpancom 687 1 (𝜑𝐹 = ran (𝑥𝑋 ↦ ⟨𝐵, 𝐴⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wcel 2111  wrex 3107  wss 3881  cop 4531   class class class wbr 5030  cmpt 5110   × cxp 5517  ccnv 5518  ran crn 5520  Rel wrel 5524
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-fv 6332
This theorem is referenced by:  pi1xfrcnvlem  23661
  Copyright terms: Public domain W3C validator