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

Theorem pw2f1olem 8221
 Description: Lemma for pw2f1o 8222. (Contributed by Mario Carneiro, 6-Oct-2014.)
Hypotheses
Ref Expression
pw2f1o.1 (𝜑𝐴𝑉)
pw2f1o.2 (𝜑𝐵𝑊)
pw2f1o.3 (𝜑𝐶𝑊)
pw2f1o.4 (𝜑𝐵𝐶)
Assertion
Ref Expression
pw2f1olem (𝜑 → ((𝑆 ∈ 𝒫 𝐴𝐺 = (𝑧𝐴 ↦ if(𝑧𝑆, 𝐶, 𝐵))) ↔ (𝐺 ∈ ({𝐵, 𝐶} ↑𝑚 𝐴) ∧ 𝑆 = (𝐺 “ {𝐶}))))
Distinct variable groups:   𝑧,𝐴   𝑧,𝐵   𝑧,𝐶   𝑧,𝑆
Allowed substitution hints:   𝜑(𝑧)   𝐺(𝑧)   𝑉(𝑧)   𝑊(𝑧)

Proof of Theorem pw2f1olem
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 pw2f1o.3 . . . . . . . . . 10 (𝜑𝐶𝑊)
2 prid2g 4432 . . . . . . . . . 10 (𝐶𝑊𝐶 ∈ {𝐵, 𝐶})
31, 2syl 17 . . . . . . . . 9 (𝜑𝐶 ∈ {𝐵, 𝐶})
4 pw2f1o.2 . . . . . . . . . 10 (𝜑𝐵𝑊)
5 prid1g 4431 . . . . . . . . . 10 (𝐵𝑊𝐵 ∈ {𝐵, 𝐶})
64, 5syl 17 . . . . . . . . 9 (𝜑𝐵 ∈ {𝐵, 𝐶})
73, 6ifcld 4267 . . . . . . . 8 (𝜑 → if(𝑦𝑆, 𝐶, 𝐵) ∈ {𝐵, 𝐶})
87adantr 472 . . . . . . 7 ((𝜑𝑦𝐴) → if(𝑦𝑆, 𝐶, 𝐵) ∈ {𝐵, 𝐶})
9 eqid 2752 . . . . . . 7 (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)) = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵))
108, 9fmptd 6540 . . . . . 6 (𝜑 → (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)):𝐴⟶{𝐵, 𝐶})
1110adantr 472 . . . . 5 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)):𝐴⟶{𝐵, 𝐶})
12 simprr 813 . . . . . 6 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → 𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))
1312feq1d 6183 . . . . 5 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → (𝐺:𝐴⟶{𝐵, 𝐶} ↔ (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)):𝐴⟶{𝐵, 𝐶}))
1411, 13mpbird 247 . . . 4 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → 𝐺:𝐴⟶{𝐵, 𝐶})
15 iftrue 4228 . . . . . . . . 9 (𝑥𝑆 → if(𝑥𝑆, 𝐶, 𝐵) = 𝐶)
16 pw2f1o.4 . . . . . . . . . . . 12 (𝜑𝐵𝐶)
1716ad2antrr 764 . . . . . . . . . . 11 (((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) ∧ 𝑥𝐴) → 𝐵𝐶)
18 iffalse 4231 . . . . . . . . . . . 12 𝑥𝑆 → if(𝑥𝑆, 𝐶, 𝐵) = 𝐵)
1918neeq1d 2983 . . . . . . . . . . 11 𝑥𝑆 → (if(𝑥𝑆, 𝐶, 𝐵) ≠ 𝐶𝐵𝐶))
2017, 19syl5ibrcom 237 . . . . . . . . . 10 (((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) ∧ 𝑥𝐴) → (¬ 𝑥𝑆 → if(𝑥𝑆, 𝐶, 𝐵) ≠ 𝐶))
2120necon4bd 2944 . . . . . . . . 9 (((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) ∧ 𝑥𝐴) → (if(𝑥𝑆, 𝐶, 𝐵) = 𝐶𝑥𝑆))
2215, 21impbid2 216 . . . . . . . 8 (((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) ∧ 𝑥𝐴) → (𝑥𝑆 ↔ if(𝑥𝑆, 𝐶, 𝐵) = 𝐶))
23 simplrr 820 . . . . . . . . . . 11 (((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) ∧ 𝑥𝐴) → 𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))
2423fveq1d 6346 . . . . . . . . . 10 (((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) ∧ 𝑥𝐴) → (𝐺𝑥) = ((𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵))‘𝑥))
25 id 22 . . . . . . . . . . 11 (𝑥𝐴𝑥𝐴)
263, 6ifcld 4267 . . . . . . . . . . . 12 (𝜑 → if(𝑥𝑆, 𝐶, 𝐵) ∈ {𝐵, 𝐶})
2726adantr 472 . . . . . . . . . . 11 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → if(𝑥𝑆, 𝐶, 𝐵) ∈ {𝐵, 𝐶})
28 eleq1w 2814 . . . . . . . . . . . . 13 (𝑦 = 𝑥 → (𝑦𝑆𝑥𝑆))
2928ifbid 4244 . . . . . . . . . . . 12 (𝑦 = 𝑥 → if(𝑦𝑆, 𝐶, 𝐵) = if(𝑥𝑆, 𝐶, 𝐵))
3029, 9fvmptg 6434 . . . . . . . . . . 11 ((𝑥𝐴 ∧ if(𝑥𝑆, 𝐶, 𝐵) ∈ {𝐵, 𝐶}) → ((𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵))‘𝑥) = if(𝑥𝑆, 𝐶, 𝐵))
3125, 27, 30syl2anr 496 . . . . . . . . . 10 (((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) ∧ 𝑥𝐴) → ((𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵))‘𝑥) = if(𝑥𝑆, 𝐶, 𝐵))
3224, 31eqtrd 2786 . . . . . . . . 9 (((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) ∧ 𝑥𝐴) → (𝐺𝑥) = if(𝑥𝑆, 𝐶, 𝐵))
3332eqeq1d 2754 . . . . . . . 8 (((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) ∧ 𝑥𝐴) → ((𝐺𝑥) = 𝐶 ↔ if(𝑥𝑆, 𝐶, 𝐵) = 𝐶))
3422, 33bitr4d 271 . . . . . . 7 (((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) ∧ 𝑥𝐴) → (𝑥𝑆 ↔ (𝐺𝑥) = 𝐶))
3534pm5.32da 676 . . . . . 6 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → ((𝑥𝐴𝑥𝑆) ↔ (𝑥𝐴 ∧ (𝐺𝑥) = 𝐶)))
36 simprl 811 . . . . . . . 8 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → 𝑆𝐴)
3736sseld 3735 . . . . . . 7 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → (𝑥𝑆𝑥𝐴))
3837pm4.71rd 670 . . . . . 6 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → (𝑥𝑆 ↔ (𝑥𝐴𝑥𝑆)))
39 ffn 6198 . . . . . . . 8 (𝐺:𝐴⟶{𝐵, 𝐶} → 𝐺 Fn 𝐴)
4014, 39syl 17 . . . . . . 7 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → 𝐺 Fn 𝐴)
41 fniniseg 6493 . . . . . . 7 (𝐺 Fn 𝐴 → (𝑥 ∈ (𝐺 “ {𝐶}) ↔ (𝑥𝐴 ∧ (𝐺𝑥) = 𝐶)))
4240, 41syl 17 . . . . . 6 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → (𝑥 ∈ (𝐺 “ {𝐶}) ↔ (𝑥𝐴 ∧ (𝐺𝑥) = 𝐶)))
4335, 38, 423bitr4d 300 . . . . 5 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → (𝑥𝑆𝑥 ∈ (𝐺 “ {𝐶})))
4443eqrdv 2750 . . . 4 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → 𝑆 = (𝐺 “ {𝐶}))
4514, 44jca 555 . . 3 ((𝜑 ∧ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))) → (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶})))
46 simprr 813 . . . . 5 ((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) → 𝑆 = (𝐺 “ {𝐶}))
47 cnvimass 5635 . . . . . 6 (𝐺 “ {𝐶}) ⊆ dom 𝐺
48 fdm 6204 . . . . . . 7 (𝐺:𝐴⟶{𝐵, 𝐶} → dom 𝐺 = 𝐴)
4948ad2antrl 766 . . . . . 6 ((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) → dom 𝐺 = 𝐴)
5047, 49syl5sseq 3786 . . . . 5 ((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) → (𝐺 “ {𝐶}) ⊆ 𝐴)
5146, 50eqsstrd 3772 . . . 4 ((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) → 𝑆𝐴)
5239ad2antrl 766 . . . . . 6 ((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) → 𝐺 Fn 𝐴)
53 dffn5 6395 . . . . . 6 (𝐺 Fn 𝐴𝐺 = (𝑦𝐴 ↦ (𝐺𝑦)))
5452, 53sylib 208 . . . . 5 ((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) → 𝐺 = (𝑦𝐴 ↦ (𝐺𝑦)))
55 simplrr 820 . . . . . . . . . . 11 (((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) → 𝑆 = (𝐺 “ {𝐶}))
5655eleq2d 2817 . . . . . . . . . 10 (((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) → (𝑦𝑆𝑦 ∈ (𝐺 “ {𝐶})))
57 fniniseg 6493 . . . . . . . . . . . 12 (𝐺 Fn 𝐴 → (𝑦 ∈ (𝐺 “ {𝐶}) ↔ (𝑦𝐴 ∧ (𝐺𝑦) = 𝐶)))
5852, 57syl 17 . . . . . . . . . . 11 ((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) → (𝑦 ∈ (𝐺 “ {𝐶}) ↔ (𝑦𝐴 ∧ (𝐺𝑦) = 𝐶)))
5958baibd 986 . . . . . . . . . 10 (((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) → (𝑦 ∈ (𝐺 “ {𝐶}) ↔ (𝐺𝑦) = 𝐶))
6056, 59bitrd 268 . . . . . . . . 9 (((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) → (𝑦𝑆 ↔ (𝐺𝑦) = 𝐶))
6160biimpa 502 . . . . . . . 8 ((((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) ∧ 𝑦𝑆) → (𝐺𝑦) = 𝐶)
62 iftrue 4228 . . . . . . . . 9 (𝑦𝑆 → if(𝑦𝑆, 𝐶, 𝐵) = 𝐶)
6362adantl 473 . . . . . . . 8 ((((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) ∧ 𝑦𝑆) → if(𝑦𝑆, 𝐶, 𝐵) = 𝐶)
6461, 63eqtr4d 2789 . . . . . . 7 ((((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) ∧ 𝑦𝑆) → (𝐺𝑦) = if(𝑦𝑆, 𝐶, 𝐵))
65 simprl 811 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) → 𝐺:𝐴⟶{𝐵, 𝐶})
6665ffvelrnda 6514 . . . . . . . . . . . . 13 (((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) → (𝐺𝑦) ∈ {𝐵, 𝐶})
67 fvex 6354 . . . . . . . . . . . . . 14 (𝐺𝑦) ∈ V
6867elpr 4335 . . . . . . . . . . . . 13 ((𝐺𝑦) ∈ {𝐵, 𝐶} ↔ ((𝐺𝑦) = 𝐵 ∨ (𝐺𝑦) = 𝐶))
6966, 68sylib 208 . . . . . . . . . . . 12 (((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) → ((𝐺𝑦) = 𝐵 ∨ (𝐺𝑦) = 𝐶))
7069ord 391 . . . . . . . . . . 11 (((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) → (¬ (𝐺𝑦) = 𝐵 → (𝐺𝑦) = 𝐶))
7170, 60sylibrd 249 . . . . . . . . . 10 (((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) → (¬ (𝐺𝑦) = 𝐵𝑦𝑆))
7271con1d 139 . . . . . . . . 9 (((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) → (¬ 𝑦𝑆 → (𝐺𝑦) = 𝐵))
7372imp 444 . . . . . . . 8 ((((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) ∧ ¬ 𝑦𝑆) → (𝐺𝑦) = 𝐵)
74 iffalse 4231 . . . . . . . . 9 𝑦𝑆 → if(𝑦𝑆, 𝐶, 𝐵) = 𝐵)
7574adantl 473 . . . . . . . 8 ((((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) ∧ ¬ 𝑦𝑆) → if(𝑦𝑆, 𝐶, 𝐵) = 𝐵)
7673, 75eqtr4d 2789 . . . . . . 7 ((((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) ∧ ¬ 𝑦𝑆) → (𝐺𝑦) = if(𝑦𝑆, 𝐶, 𝐵))
7764, 76pm2.61dan 867 . . . . . 6 (((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) ∧ 𝑦𝐴) → (𝐺𝑦) = if(𝑦𝑆, 𝐶, 𝐵))
7877mpteq2dva 4888 . . . . 5 ((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) → (𝑦𝐴 ↦ (𝐺𝑦)) = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))
7954, 78eqtrd 2786 . . . 4 ((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) → 𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))
8051, 79jca 555 . . 3 ((𝜑 ∧ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))) → (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵))))
8145, 80impbida 913 . 2 (𝜑 → ((𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵))) ↔ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))))
82 pw2f1o.1 . . . 4 (𝜑𝐴𝑉)
83 elpw2g 4968 . . . 4 (𝐴𝑉 → (𝑆 ∈ 𝒫 𝐴𝑆𝐴))
8482, 83syl 17 . . 3 (𝜑 → (𝑆 ∈ 𝒫 𝐴𝑆𝐴))
85 eleq1w 2814 . . . . . . 7 (𝑧 = 𝑦 → (𝑧𝑆𝑦𝑆))
8685ifbid 4244 . . . . . 6 (𝑧 = 𝑦 → if(𝑧𝑆, 𝐶, 𝐵) = if(𝑦𝑆, 𝐶, 𝐵))
8786cbvmptv 4894 . . . . 5 (𝑧𝐴 ↦ if(𝑧𝑆, 𝐶, 𝐵)) = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵))
8887a1i 11 . . . 4 (𝜑 → (𝑧𝐴 ↦ if(𝑧𝑆, 𝐶, 𝐵)) = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))
8988eqeq2d 2762 . . 3 (𝜑 → (𝐺 = (𝑧𝐴 ↦ if(𝑧𝑆, 𝐶, 𝐵)) ↔ 𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵))))
9084, 89anbi12d 749 . 2 (𝜑 → ((𝑆 ∈ 𝒫 𝐴𝐺 = (𝑧𝐴 ↦ if(𝑧𝑆, 𝐶, 𝐵))) ↔ (𝑆𝐴𝐺 = (𝑦𝐴 ↦ if(𝑦𝑆, 𝐶, 𝐵)))))
91 prex 5050 . . . 4 {𝐵, 𝐶} ∈ V
92 elmapg 8028 . . . 4 (({𝐵, 𝐶} ∈ V ∧ 𝐴𝑉) → (𝐺 ∈ ({𝐵, 𝐶} ↑𝑚 𝐴) ↔ 𝐺:𝐴⟶{𝐵, 𝐶}))
9391, 82, 92sylancr 698 . . 3 (𝜑 → (𝐺 ∈ ({𝐵, 𝐶} ↑𝑚 𝐴) ↔ 𝐺:𝐴⟶{𝐵, 𝐶}))
9493anbi1d 743 . 2 (𝜑 → ((𝐺 ∈ ({𝐵, 𝐶} ↑𝑚 𝐴) ∧ 𝑆 = (𝐺 “ {𝐶})) ↔ (𝐺:𝐴⟶{𝐵, 𝐶} ∧ 𝑆 = (𝐺 “ {𝐶}))))
9581, 90, 943bitr4d 300 1 (𝜑 → ((𝑆 ∈ 𝒫 𝐴𝐺 = (𝑧𝐴 ↦ if(𝑧𝑆, 𝐶, 𝐵))) ↔ (𝐺 ∈ ({𝐵, 𝐶} ↑𝑚 𝐴) ∧ 𝑆 = (𝐺 “ {𝐶}))))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∨ wo 382   ∧ wa 383   = wceq 1624   ∈ wcel 2131   ≠ wne 2924  Vcvv 3332   ⊆ wss 3707  ifcif 4222  𝒫 cpw 4294  {csn 4313  {cpr 4315   ↦ cmpt 4873  ◡ccnv 5257  dom cdm 5258   “ cima 5261   Fn wfn 6036  ⟶wf 6037  ‘cfv 6041  (class class class)co 6805   ↑𝑚 cmap 8015 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1863  ax-4 1878  ax-5 1980  ax-6 2046  ax-7 2082  ax-8 2133  ax-9 2140  ax-10 2160  ax-11 2175  ax-12 2188  ax-13 2383  ax-ext 2732  ax-sep 4925  ax-nul 4933  ax-pow 4984  ax-pr 5047  ax-un 7106 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1627  df-ex 1846  df-nf 1851  df-sb 2039  df-eu 2603  df-mo 2604  df-clab 2739  df-cleq 2745  df-clel 2748  df-nfc 2883  df-ne 2925  df-ral 3047  df-rex 3048  df-rab 3051  df-v 3334  df-sbc 3569  df-dif 3710  df-un 3712  df-in 3714  df-ss 3721  df-nul 4051  df-if 4223  df-pw 4296  df-sn 4314  df-pr 4316  df-op 4320  df-uni 4581  df-br 4797  df-opab 4857  df-mpt 4874  df-id 5166  df-xp 5264  df-rel 5265  df-cnv 5266  df-co 5267  df-dm 5268  df-rn 5269  df-res 5270  df-ima 5271  df-iota 6004  df-fun 6043  df-fn 6044  df-f 6045  df-fv 6049  df-ov 6808  df-oprab 6809  df-mpt2 6810  df-map 8017 This theorem is referenced by:  pw2f1o  8222  sqff1o  25099
 Copyright terms: Public domain W3C validator