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

Theorem ralrnmpt 5722
Description: A restricted quantifier over an image set. (Contributed by Mario Carneiro, 20-Aug-2015.)
Hypotheses
Ref Expression
ralrnmpt.1 𝐹 = (𝑥𝐴𝐵)
ralrnmpt.2 (𝑦 = 𝐵 → (𝜓𝜒))
Assertion
Ref Expression
ralrnmpt (∀𝑥𝐴 𝐵𝑉 → (∀𝑦 ∈ ran 𝐹𝜓 ↔ ∀𝑥𝐴 𝜒))
Distinct variable groups:   𝑥,𝐴   𝑦,𝐵   𝜒,𝑦   𝑦,𝐹   𝜓,𝑥
Allowed substitution hints:   𝜓(𝑦)   𝜒(𝑥)   𝐴(𝑦)   𝐵(𝑥)   𝐹(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem ralrnmpt
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ralrnmpt.1 . . . . 5 𝐹 = (𝑥𝐴𝐵)
21fnmpt 5402 . . . 4 (∀𝑥𝐴 𝐵𝑉𝐹 Fn 𝐴)
3 dfsbcq 3000 . . . . 5 (𝑤 = (𝐹𝑧) → ([𝑤 / 𝑦]𝜓[(𝐹𝑧) / 𝑦]𝜓))
43ralrn 5718 . . . 4 (𝐹 Fn 𝐴 → (∀𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∀𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓))
52, 4syl 14 . . 3 (∀𝑥𝐴 𝐵𝑉 → (∀𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∀𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓))
6 nfv 1551 . . . . 5 𝑤𝜓
7 nfsbc1v 3017 . . . . 5 𝑦[𝑤 / 𝑦]𝜓
8 sbceq1a 3008 . . . . 5 (𝑦 = 𝑤 → (𝜓[𝑤 / 𝑦]𝜓))
96, 7, 8cbvral 2734 . . . 4 (∀𝑦 ∈ ran 𝐹𝜓 ↔ ∀𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓)
109bicomi 132 . . 3 (∀𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∀𝑦 ∈ ran 𝐹𝜓)
11 nfmpt1 4137 . . . . . . 7 𝑥(𝑥𝐴𝐵)
121, 11nfcxfr 2345 . . . . . 6 𝑥𝐹
13 nfcv 2348 . . . . . 6 𝑥𝑧
1412, 13nffv 5586 . . . . 5 𝑥(𝐹𝑧)
15 nfv 1551 . . . . 5 𝑥𝜓
1614, 15nfsbc 3019 . . . 4 𝑥[(𝐹𝑧) / 𝑦]𝜓
17 nfv 1551 . . . 4 𝑧[(𝐹𝑥) / 𝑦]𝜓
18 fveq2 5576 . . . . 5 (𝑧 = 𝑥 → (𝐹𝑧) = (𝐹𝑥))
19 dfsbcq 3000 . . . . 5 ((𝐹𝑧) = (𝐹𝑥) → ([(𝐹𝑧) / 𝑦]𝜓[(𝐹𝑥) / 𝑦]𝜓))
2018, 19syl 14 . . . 4 (𝑧 = 𝑥 → ([(𝐹𝑧) / 𝑦]𝜓[(𝐹𝑥) / 𝑦]𝜓))
2116, 17, 20cbvral 2734 . . 3 (∀𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓 ↔ ∀𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓)
225, 10, 213bitr3g 222 . 2 (∀𝑥𝐴 𝐵𝑉 → (∀𝑦 ∈ ran 𝐹𝜓 ↔ ∀𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓))
231fvmpt2 5663 . . . . . 6 ((𝑥𝐴𝐵𝑉) → (𝐹𝑥) = 𝐵)
24 dfsbcq 3000 . . . . . 6 ((𝐹𝑥) = 𝐵 → ([(𝐹𝑥) / 𝑦]𝜓[𝐵 / 𝑦]𝜓))
2523, 24syl 14 . . . . 5 ((𝑥𝐴𝐵𝑉) → ([(𝐹𝑥) / 𝑦]𝜓[𝐵 / 𝑦]𝜓))
26 ralrnmpt.2 . . . . . . 7 (𝑦 = 𝐵 → (𝜓𝜒))
2726sbcieg 3031 . . . . . 6 (𝐵𝑉 → ([𝐵 / 𝑦]𝜓𝜒))
2827adantl 277 . . . . 5 ((𝑥𝐴𝐵𝑉) → ([𝐵 / 𝑦]𝜓𝜒))
2925, 28bitrd 188 . . . 4 ((𝑥𝐴𝐵𝑉) → ([(𝐹𝑥) / 𝑦]𝜓𝜒))
3029ralimiaa 2568 . . 3 (∀𝑥𝐴 𝐵𝑉 → ∀𝑥𝐴 ([(𝐹𝑥) / 𝑦]𝜓𝜒))
31 ralbi 2638 . . 3 (∀𝑥𝐴 ([(𝐹𝑥) / 𝑦]𝜓𝜒) → (∀𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓 ↔ ∀𝑥𝐴 𝜒))
3230, 31syl 14 . 2 (∀𝑥𝐴 𝐵𝑉 → (∀𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓 ↔ ∀𝑥𝐴 𝜒))
3322, 32bitrd 188 1 (∀𝑥𝐴 𝐵𝑉 → (∀𝑦 ∈ ran 𝐹𝜓 ↔ ∀𝑥𝐴 𝜒))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1373  wcel 2176  wral 2484  [wsbc 2998  cmpt 4105  ran crn 4676   Fn wfn 5266  cfv 5271
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-iota 5232  df-fun 5273  df-fn 5274  df-fv 5279
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator