Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elixpmpt Structured version   Visualization version   GIF version

Theorem elixpmpt 50209
Description: Membership in an indexed Cartesian product over a set is equivalent to being its exact function graph with components of the indicated types. (Contributed by Zhi Wang, 14-Sep-2026.)
Hypothesis
Ref Expression
elixpmpt.a 𝐴 ∈ V
Assertion
Ref Expression
elixpmpt (𝐹 ∈ X𝑥 ∈ 𝐴 𝐵 ↔ (𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem elixpmpt
StepHypRef Expression
1 elixp2 8957 . . 3 (𝐹 ∈ X𝑥 ∈ 𝐴 𝐵 ↔ (𝐹 ∈ V ∧ 𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵))
2 3simpc 1168 . . . 4 ((𝐹 ∈ V ∧ 𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵) → (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵))
3 simpl 488 . . . . . 6 ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵) → 𝐹 Fn 𝐴)
4 elixpmpt.a . . . . . 6 𝐴 ∈ V
5 fnex 7246 . . . . . 6 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ V) → 𝐹 ∈ V)
63, 4, 5sylancl 598 . . . . 5 ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵) → 𝐹 ∈ V)
7 simpr 490 . . . . 5 ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵) → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵)
86, 3, 73jca 1146 . . . 4 ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵) → (𝐹 ∈ V ∧ 𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵))
92, 8impbii 212 . . 3 ((𝐹 ∈ V ∧ 𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵))
101, 9bitri 278 . 2 (𝐹 ∈ X𝑥 ∈ 𝐴 𝐵 ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵))
11 dffn5 6966 . 2 (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
1210, 11bianbi 639 1 (𝐹 ∈ X𝑥 ∈ 𝐴 𝐵 ↔ (𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ↦ cmpt 5189   Fn wfn 6553  ‘cfv 6558  Xcixp 8953
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-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395
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-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  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-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ixp 8954
This theorem is used by:  isnat3  50547
  Copyright terms: Public domain W3C validator