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

Theorem fmptsnd 6313
Description: Express a singleton function in maps-to notation. Deduction form of fmptsng 6312. (Contributed by AV, 4-Aug-2019.)
Hypotheses
Ref Expression
fmptsnd.1 ((𝜑𝑥 = 𝐴) → 𝐵 = 𝐶)
fmptsnd.2 (𝜑𝐴𝑉)
fmptsnd.3 (𝜑𝐶𝑊)
Assertion
Ref Expression
fmptsnd (𝜑 → {⟨𝐴, 𝐶⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐶   𝜑,𝑥
Allowed substitution hints:   𝐵(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem fmptsnd
Dummy variables 𝑝 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 velsn 4135 . . . . 5 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
21bicomi 212 . . . 4 (𝑥 = 𝐴𝑥 ∈ {𝐴})
32anbi1i 726 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) ↔ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵))
43opabbii 4638 . 2 {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴𝑦 = 𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵)}
5 velsn 4135 . . . . 5 (𝑝 ∈ {⟨𝐴, 𝐶⟩} ↔ 𝑝 = ⟨𝐴, 𝐶⟩)
6 eqidd 2605 . . . . . . . 8 (𝜑𝐴 = 𝐴)
7 eqidd 2605 . . . . . . . 8 (𝜑𝐶 = 𝐶)
8 sbcan 3439 . . . . . . . . . . 11 ([𝐶 / 𝑦](𝑥 = 𝐴𝑦 = 𝐵) ↔ ([𝐶 / 𝑦]𝑥 = 𝐴[𝐶 / 𝑦]𝑦 = 𝐵))
9 fmptsnd.3 . . . . . . . . . . . . 13 (𝜑𝐶𝑊)
10 sbcg 3464 . . . . . . . . . . . . 13 (𝐶𝑊 → ([𝐶 / 𝑦]𝑥 = 𝐴𝑥 = 𝐴))
119, 10syl 17 . . . . . . . . . . . 12 (𝜑 → ([𝐶 / 𝑦]𝑥 = 𝐴𝑥 = 𝐴))
12 eqsbc3 3436 . . . . . . . . . . . . 13 (𝐶𝑊 → ([𝐶 / 𝑦]𝑦 = 𝐵𝐶 = 𝐵))
139, 12syl 17 . . . . . . . . . . . 12 (𝜑 → ([𝐶 / 𝑦]𝑦 = 𝐵𝐶 = 𝐵))
1411, 13anbi12d 742 . . . . . . . . . . 11 (𝜑 → (([𝐶 / 𝑦]𝑥 = 𝐴[𝐶 / 𝑦]𝑦 = 𝐵) ↔ (𝑥 = 𝐴𝐶 = 𝐵)))
158, 14syl5bb 270 . . . . . . . . . 10 (𝜑 → ([𝐶 / 𝑦](𝑥 = 𝐴𝑦 = 𝐵) ↔ (𝑥 = 𝐴𝐶 = 𝐵)))
1615sbcbidv 3451 . . . . . . . . 9 (𝜑 → ([𝐴 / 𝑥][𝐶 / 𝑦](𝑥 = 𝐴𝑦 = 𝐵) ↔ [𝐴 / 𝑥](𝑥 = 𝐴𝐶 = 𝐵)))
17 fmptsnd.2 . . . . . . . . . 10 (𝜑𝐴𝑉)
18 eqeq1 2608 . . . . . . . . . . . 12 (𝑥 = 𝐴 → (𝑥 = 𝐴𝐴 = 𝐴))
1918adantl 480 . . . . . . . . . . 11 ((𝜑𝑥 = 𝐴) → (𝑥 = 𝐴𝐴 = 𝐴))
20 fmptsnd.1 . . . . . . . . . . . 12 ((𝜑𝑥 = 𝐴) → 𝐵 = 𝐶)
2120eqeq2d 2614 . . . . . . . . . . 11 ((𝜑𝑥 = 𝐴) → (𝐶 = 𝐵𝐶 = 𝐶))
2219, 21anbi12d 742 . . . . . . . . . 10 ((𝜑𝑥 = 𝐴) → ((𝑥 = 𝐴𝐶 = 𝐵) ↔ (𝐴 = 𝐴𝐶 = 𝐶)))
2317, 22sbcied 3433 . . . . . . . . 9 (𝜑 → ([𝐴 / 𝑥](𝑥 = 𝐴𝐶 = 𝐵) ↔ (𝐴 = 𝐴𝐶 = 𝐶)))
2416, 23bitrd 266 . . . . . . . 8 (𝜑 → ([𝐴 / 𝑥][𝐶 / 𝑦](𝑥 = 𝐴𝑦 = 𝐵) ↔ (𝐴 = 𝐴𝐶 = 𝐶)))
256, 7, 24mpbir2and 958 . . . . . . 7 (𝜑[𝐴 / 𝑥][𝐶 / 𝑦](𝑥 = 𝐴𝑦 = 𝐵))
26 opelopabsb 4895 . . . . . . 7 (⟨𝐴, 𝐶⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴𝑦 = 𝐵)} ↔ [𝐴 / 𝑥][𝐶 / 𝑦](𝑥 = 𝐴𝑦 = 𝐵))
2725, 26sylibr 222 . . . . . 6 (𝜑 → ⟨𝐴, 𝐶⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴𝑦 = 𝐵)})
28 eleq1 2670 . . . . . 6 (𝑝 = ⟨𝐴, 𝐶⟩ → (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴𝑦 = 𝐵)} ↔ ⟨𝐴, 𝐶⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴𝑦 = 𝐵)}))
2927, 28syl5ibrcom 235 . . . . 5 (𝜑 → (𝑝 = ⟨𝐴, 𝐶⟩ → 𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴𝑦 = 𝐵)}))
305, 29syl5bi 230 . . . 4 (𝜑 → (𝑝 ∈ {⟨𝐴, 𝐶⟩} → 𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴𝑦 = 𝐵)}))
31 elopab 4893 . . . . 5 (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴𝑦 = 𝐵)} ↔ ∃𝑥𝑦(𝑝 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐴𝑦 = 𝐵)))
32 opeq12 4331 . . . . . . . . . . . 12 ((𝑥 = 𝐴𝑦 = 𝐵) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
3332adantl 480 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
3433eqeq2d 2614 . . . . . . . . . 10 ((𝜑 ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (𝑝 = ⟨𝑥, 𝑦⟩ ↔ 𝑝 = ⟨𝐴, 𝐵⟩))
3520adantrr 748 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → 𝐵 = 𝐶)
3635opeq2d 4336 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → ⟨𝐴, 𝐵⟩ = ⟨𝐴, 𝐶⟩)
37 opex 4848 . . . . . . . . . . . . 13 𝐴, 𝐶⟩ ∈ V
3837snid 4149 . . . . . . . . . . . 12 𝐴, 𝐶⟩ ∈ {⟨𝐴, 𝐶⟩}
3936, 38syl6eqel 2690 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → ⟨𝐴, 𝐵⟩ ∈ {⟨𝐴, 𝐶⟩})
40 eleq1 2670 . . . . . . . . . . 11 (𝑝 = ⟨𝐴, 𝐵⟩ → (𝑝 ∈ {⟨𝐴, 𝐶⟩} ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝐴, 𝐶⟩}))
4139, 40syl5ibrcom 235 . . . . . . . . . 10 ((𝜑 ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (𝑝 = ⟨𝐴, 𝐵⟩ → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
4234, 41sylbid 228 . . . . . . . . 9 ((𝜑 ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (𝑝 = ⟨𝑥, 𝑦⟩ → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
4342ex 448 . . . . . . . 8 (𝜑 → ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑝 = ⟨𝑥, 𝑦⟩ → 𝑝 ∈ {⟨𝐴, 𝐶⟩})))
4443com23 83 . . . . . . 7 (𝜑 → (𝑝 = ⟨𝑥, 𝑦⟩ → ((𝑥 = 𝐴𝑦 = 𝐵) → 𝑝 ∈ {⟨𝐴, 𝐶⟩})))
4544impd 445 . . . . . 6 (𝜑 → ((𝑝 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
4645exlimdvv 1847 . . . . 5 (𝜑 → (∃𝑥𝑦(𝑝 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
4731, 46syl5bi 230 . . . 4 (𝜑 → (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴𝑦 = 𝐵)} → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
4830, 47impbid 200 . . 3 (𝜑 → (𝑝 ∈ {⟨𝐴, 𝐶⟩} ↔ 𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴𝑦 = 𝐵)}))
4948eqrdv 2602 . 2 (𝜑 → {⟨𝐴, 𝐶⟩} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴𝑦 = 𝐵)})
50 df-mpt 4634 . . 3 (𝑥 ∈ {𝐴} ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵)}
5150a1i 11 . 2 (𝜑 → (𝑥 ∈ {𝐴} ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵)})
524, 49, 513eqtr4a 2664 1 (𝜑 → {⟨𝐴, 𝐶⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 194  wa 382   = wceq 1474  wex 1694  wcel 1975  [wsbc 3396  {csn 4119  cop 4125  {copab 4631  cmpt 4632
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1711  ax-4 1726  ax-5 1825  ax-6 1873  ax-7 1920  ax-9 1984  ax-10 2004  ax-11 2019  ax-12 2031  ax-13 2227  ax-ext 2584  ax-sep 4698  ax-nul 4707  ax-pr 4823
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1866  df-eu 2456  df-mo 2457  df-clab 2591  df-cleq 2597  df-clel 2600  df-nfc 2734  df-ne 2776  df-ral 2895  df-rex 2896  df-rab 2899  df-v 3169  df-sbc 3397  df-dif 3537  df-un 3539  df-in 3541  df-ss 3548  df-nul 3869  df-if 4031  df-sn 4120  df-pr 4122  df-op 4126  df-opab 4633  df-mpt 4634
This theorem is referenced by:  fmptapd  6315  fmptpr  6316  mpt2sn  7127
  Copyright terms: Public domain W3C validator