ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fabexg GIF version

Theorem fabexg 5524
Description: Existence of a set of functions. (Contributed by Paul Chapman, 25-Feb-2008.)
Hypothesis
Ref Expression
fabexg.1 𝐹 = {𝑥 ∣ (𝑥:𝐴𝐵𝜑)}
Assertion
Ref Expression
fabexg ((𝐴𝐶𝐵𝐷) → 𝐹 ∈ V)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥)   𝐶(𝑥)   𝐷(𝑥)   𝐹(𝑥)

Proof of Theorem fabexg
StepHypRef Expression
1 xpexg 4840 . 2 ((𝐴𝐶𝐵𝐷) → (𝐴 × 𝐵) ∈ V)
2 pwexg 4270 . 2 ((𝐴 × 𝐵) ∈ V → 𝒫 (𝐴 × 𝐵) ∈ V)
3 fabexg.1 . . . . 5 𝐹 = {𝑥 ∣ (𝑥:𝐴𝐵𝜑)}
4 fssxp 5502 . . . . . . . 8 (𝑥:𝐴𝐵𝑥 ⊆ (𝐴 × 𝐵))
5 velpw 3659 . . . . . . . 8 (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ↔ 𝑥 ⊆ (𝐴 × 𝐵))
64, 5sylibr 134 . . . . . . 7 (𝑥:𝐴𝐵𝑥 ∈ 𝒫 (𝐴 × 𝐵))
76anim1i 340 . . . . . 6 ((𝑥:𝐴𝐵𝜑) → (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑))
87ss2abi 3299 . . . . 5 {𝑥 ∣ (𝑥:𝐴𝐵𝜑)} ⊆ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)}
93, 8eqsstri 3259 . . . 4 𝐹 ⊆ {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)}
10 ssab2 3311 . . . 4 {𝑥 ∣ (𝑥 ∈ 𝒫 (𝐴 × 𝐵) ∧ 𝜑)} ⊆ 𝒫 (𝐴 × 𝐵)
119, 10sstri 3236 . . 3 𝐹 ⊆ 𝒫 (𝐴 × 𝐵)
12 ssexg 4228 . . 3 ((𝐹 ⊆ 𝒫 (𝐴 × 𝐵) ∧ 𝒫 (𝐴 × 𝐵) ∈ V) → 𝐹 ∈ V)
1311, 12mpan 424 . 2 (𝒫 (𝐴 × 𝐵) ∈ V → 𝐹 ∈ V)
141, 2, 133syl 17 1 ((𝐴𝐶𝐵𝐷) → 𝐹 ∈ V)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2202  {cab 2217  Vcvv 2802  wss 3200  𝒫 cpw 3652   × cxp 4723  wf 5322
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-xp 4731  df-rel 4732  df-cnv 4733  df-dm 4735  df-rn 4736  df-fun 5328  df-fn 5329  df-f 5330
This theorem is referenced by:  fabex  5525  f1oabexg  5595
  Copyright terms: Public domain W3C validator