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

Theorem wemaplem2 8658
Description: Lemma for wemapso 8662. Transitivity. (Contributed by Stefan O'Rear, 17-Jan-2015.)
Hypotheses
Ref Expression
wemapso.t 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧)𝑆(𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))}
wemaplem2.a (𝜑𝐴 ∈ V)
wemaplem2.p (𝜑𝑃 ∈ (𝐵𝑚 𝐴))
wemaplem2.x (𝜑𝑋 ∈ (𝐵𝑚 𝐴))
wemaplem2.q (𝜑𝑄 ∈ (𝐵𝑚 𝐴))
wemaplem2.r (𝜑𝑅 Or 𝐴)
wemaplem2.s (𝜑𝑆 Po 𝐵)
wemaplem2.px1 (𝜑𝑎𝐴)
wemaplem2.px2 (𝜑 → (𝑃𝑎)𝑆(𝑋𝑎))
wemaplem2.px3 (𝜑 → ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)))
wemaplem2.xq1 (𝜑𝑏𝐴)
wemaplem2.xq2 (𝜑 → (𝑋𝑏)𝑆(𝑄𝑏))
wemaplem2.xq3 (𝜑 → ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐)))
Assertion
Ref Expression
wemaplem2 (𝜑𝑃𝑇𝑄)
Distinct variable groups:   𝑎,𝑏,𝑐,𝑥,𝐵   𝑇,𝑎,𝑏,𝑐   𝑤,𝑎,𝑦,𝑧,𝑋,𝑏,𝑐,𝑥   𝐴,𝑎,𝑏,𝑐,𝑤,𝑥,𝑦,𝑧   𝑃,𝑎,𝑏,𝑐,𝑤,𝑥,𝑦,𝑧   𝑄,𝑎,𝑏,𝑐,𝑤,𝑥,𝑦,𝑧   𝑅,𝑎,𝑏,𝑐,𝑤,𝑥,𝑦,𝑧   𝑆,𝑎,𝑏,𝑐,𝑤,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤,𝑎,𝑏,𝑐)   𝐵(𝑦,𝑧,𝑤)   𝑇(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem wemaplem2
Dummy variable 𝑑 is distinct from all other variables.
StepHypRef Expression
1 wemaplem2.px1 . . . 4 (𝜑𝑎𝐴)
2 wemaplem2.xq1 . . . 4 (𝜑𝑏𝐴)
31, 2ifcld 4287 . . 3 (𝜑 → if(𝑎𝑅𝑏, 𝑎, 𝑏) ∈ 𝐴)
4 wemaplem2.px2 . . . . . . 7 (𝜑 → (𝑃𝑎)𝑆(𝑋𝑎))
54adantr 472 . . . . . 6 ((𝜑𝑎𝑅𝑏) → (𝑃𝑎)𝑆(𝑋𝑎))
6 breq1 4811 . . . . . . . . 9 (𝑐 = 𝑎 → (𝑐𝑅𝑏𝑎𝑅𝑏))
7 fveq2 6374 . . . . . . . . . 10 (𝑐 = 𝑎 → (𝑋𝑐) = (𝑋𝑎))
8 fveq2 6374 . . . . . . . . . 10 (𝑐 = 𝑎 → (𝑄𝑐) = (𝑄𝑎))
97, 8eqeq12d 2779 . . . . . . . . 9 (𝑐 = 𝑎 → ((𝑋𝑐) = (𝑄𝑐) ↔ (𝑋𝑎) = (𝑄𝑎)))
106, 9imbi12d 335 . . . . . . . 8 (𝑐 = 𝑎 → ((𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐)) ↔ (𝑎𝑅𝑏 → (𝑋𝑎) = (𝑄𝑎))))
11 wemaplem2.xq3 . . . . . . . 8 (𝜑 → ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐)))
1210, 11, 1rspcdva 3466 . . . . . . 7 (𝜑 → (𝑎𝑅𝑏 → (𝑋𝑎) = (𝑄𝑎)))
1312imp 395 . . . . . 6 ((𝜑𝑎𝑅𝑏) → (𝑋𝑎) = (𝑄𝑎))
145, 13breqtrd 4834 . . . . 5 ((𝜑𝑎𝑅𝑏) → (𝑃𝑎)𝑆(𝑄𝑎))
15 iftrue 4248 . . . . . . . 8 (𝑎𝑅𝑏 → if(𝑎𝑅𝑏, 𝑎, 𝑏) = 𝑎)
1615fveq2d 6378 . . . . . . 7 (𝑎𝑅𝑏 → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑃𝑎))
1715fveq2d 6378 . . . . . . 7 (𝑎𝑅𝑏 → (𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑄𝑎))
1816, 17breq12d 4821 . . . . . 6 (𝑎𝑅𝑏 → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑎)𝑆(𝑄𝑎)))
1918adantl 473 . . . . 5 ((𝜑𝑎𝑅𝑏) → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑎)𝑆(𝑄𝑎)))
2014, 19mpbird 248 . . . 4 ((𝜑𝑎𝑅𝑏) → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
21 wemaplem2.s . . . . . . 7 (𝜑𝑆 Po 𝐵)
2221adantr 472 . . . . . 6 ((𝜑𝑎 = 𝑏) → 𝑆 Po 𝐵)
23 wemaplem2.p . . . . . . . . . 10 (𝜑𝑃 ∈ (𝐵𝑚 𝐴))
24 elmapi 8081 . . . . . . . . . 10 (𝑃 ∈ (𝐵𝑚 𝐴) → 𝑃:𝐴𝐵)
2523, 24syl 17 . . . . . . . . 9 (𝜑𝑃:𝐴𝐵)
2625, 2ffvelrnd 6549 . . . . . . . 8 (𝜑 → (𝑃𝑏) ∈ 𝐵)
27 wemaplem2.x . . . . . . . . . 10 (𝜑𝑋 ∈ (𝐵𝑚 𝐴))
28 elmapi 8081 . . . . . . . . . 10 (𝑋 ∈ (𝐵𝑚 𝐴) → 𝑋:𝐴𝐵)
2927, 28syl 17 . . . . . . . . 9 (𝜑𝑋:𝐴𝐵)
3029, 2ffvelrnd 6549 . . . . . . . 8 (𝜑 → (𝑋𝑏) ∈ 𝐵)
31 wemaplem2.q . . . . . . . . . 10 (𝜑𝑄 ∈ (𝐵𝑚 𝐴))
32 elmapi 8081 . . . . . . . . . 10 (𝑄 ∈ (𝐵𝑚 𝐴) → 𝑄:𝐴𝐵)
3331, 32syl 17 . . . . . . . . 9 (𝜑𝑄:𝐴𝐵)
3433, 2ffvelrnd 6549 . . . . . . . 8 (𝜑 → (𝑄𝑏) ∈ 𝐵)
3526, 30, 343jca 1158 . . . . . . 7 (𝜑 → ((𝑃𝑏) ∈ 𝐵 ∧ (𝑋𝑏) ∈ 𝐵 ∧ (𝑄𝑏) ∈ 𝐵))
3635adantr 472 . . . . . 6 ((𝜑𝑎 = 𝑏) → ((𝑃𝑏) ∈ 𝐵 ∧ (𝑋𝑏) ∈ 𝐵 ∧ (𝑄𝑏) ∈ 𝐵))
37 fveq2 6374 . . . . . . . . 9 (𝑎 = 𝑏 → (𝑃𝑎) = (𝑃𝑏))
38 fveq2 6374 . . . . . . . . 9 (𝑎 = 𝑏 → (𝑋𝑎) = (𝑋𝑏))
3937, 38breq12d 4821 . . . . . . . 8 (𝑎 = 𝑏 → ((𝑃𝑎)𝑆(𝑋𝑎) ↔ (𝑃𝑏)𝑆(𝑋𝑏)))
404, 39syl5ibcom 236 . . . . . . 7 (𝜑 → (𝑎 = 𝑏 → (𝑃𝑏)𝑆(𝑋𝑏)))
4140imp 395 . . . . . 6 ((𝜑𝑎 = 𝑏) → (𝑃𝑏)𝑆(𝑋𝑏))
42 wemaplem2.xq2 . . . . . . 7 (𝜑 → (𝑋𝑏)𝑆(𝑄𝑏))
4342adantr 472 . . . . . 6 ((𝜑𝑎 = 𝑏) → (𝑋𝑏)𝑆(𝑄𝑏))
44 potr 5209 . . . . . . 7 ((𝑆 Po 𝐵 ∧ ((𝑃𝑏) ∈ 𝐵 ∧ (𝑋𝑏) ∈ 𝐵 ∧ (𝑄𝑏) ∈ 𝐵)) → (((𝑃𝑏)𝑆(𝑋𝑏) ∧ (𝑋𝑏)𝑆(𝑄𝑏)) → (𝑃𝑏)𝑆(𝑄𝑏)))
4544imp 395 . . . . . 6 (((𝑆 Po 𝐵 ∧ ((𝑃𝑏) ∈ 𝐵 ∧ (𝑋𝑏) ∈ 𝐵 ∧ (𝑄𝑏) ∈ 𝐵)) ∧ ((𝑃𝑏)𝑆(𝑋𝑏) ∧ (𝑋𝑏)𝑆(𝑄𝑏))) → (𝑃𝑏)𝑆(𝑄𝑏))
4622, 36, 41, 43, 45syl22anc 867 . . . . 5 ((𝜑𝑎 = 𝑏) → (𝑃𝑏)𝑆(𝑄𝑏))
47 ifeq1 4246 . . . . . . . . 9 (𝑎 = 𝑏 → if(𝑎𝑅𝑏, 𝑎, 𝑏) = if(𝑎𝑅𝑏, 𝑏, 𝑏))
48 ifid 4281 . . . . . . . . 9 if(𝑎𝑅𝑏, 𝑏, 𝑏) = 𝑏
4947, 48syl6eq 2814 . . . . . . . 8 (𝑎 = 𝑏 → if(𝑎𝑅𝑏, 𝑎, 𝑏) = 𝑏)
5049fveq2d 6378 . . . . . . 7 (𝑎 = 𝑏 → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑃𝑏))
5149fveq2d 6378 . . . . . . 7 (𝑎 = 𝑏 → (𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑄𝑏))
5250, 51breq12d 4821 . . . . . 6 (𝑎 = 𝑏 → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑏)𝑆(𝑄𝑏)))
5352adantl 473 . . . . 5 ((𝜑𝑎 = 𝑏) → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑏)𝑆(𝑄𝑏)))
5446, 53mpbird 248 . . . 4 ((𝜑𝑎 = 𝑏) → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
55 breq1 4811 . . . . . . . . 9 (𝑐 = 𝑏 → (𝑐𝑅𝑎𝑏𝑅𝑎))
56 fveq2 6374 . . . . . . . . . 10 (𝑐 = 𝑏 → (𝑃𝑐) = (𝑃𝑏))
57 fveq2 6374 . . . . . . . . . 10 (𝑐 = 𝑏 → (𝑋𝑐) = (𝑋𝑏))
5856, 57eqeq12d 2779 . . . . . . . . 9 (𝑐 = 𝑏 → ((𝑃𝑐) = (𝑋𝑐) ↔ (𝑃𝑏) = (𝑋𝑏)))
5955, 58imbi12d 335 . . . . . . . 8 (𝑐 = 𝑏 → ((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ↔ (𝑏𝑅𝑎 → (𝑃𝑏) = (𝑋𝑏))))
60 wemaplem2.px3 . . . . . . . 8 (𝜑 → ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)))
6159, 60, 2rspcdva 3466 . . . . . . 7 (𝜑 → (𝑏𝑅𝑎 → (𝑃𝑏) = (𝑋𝑏)))
6261imp 395 . . . . . 6 ((𝜑𝑏𝑅𝑎) → (𝑃𝑏) = (𝑋𝑏))
6342adantr 472 . . . . . 6 ((𝜑𝑏𝑅𝑎) → (𝑋𝑏)𝑆(𝑄𝑏))
6462, 63eqbrtrd 4830 . . . . 5 ((𝜑𝑏𝑅𝑎) → (𝑃𝑏)𝑆(𝑄𝑏))
65 wemaplem2.r . . . . . . . . 9 (𝜑𝑅 Or 𝐴)
66 sopo 5214 . . . . . . . . 9 (𝑅 Or 𝐴𝑅 Po 𝐴)
6765, 66syl 17 . . . . . . . 8 (𝜑𝑅 Po 𝐴)
68 po2nr 5210 . . . . . . . 8 ((𝑅 Po 𝐴 ∧ (𝑏𝐴𝑎𝐴)) → ¬ (𝑏𝑅𝑎𝑎𝑅𝑏))
6967, 2, 1, 68syl12anc 865 . . . . . . 7 (𝜑 → ¬ (𝑏𝑅𝑎𝑎𝑅𝑏))
70 nan 859 . . . . . . 7 ((𝜑 → ¬ (𝑏𝑅𝑎𝑎𝑅𝑏)) ↔ ((𝜑𝑏𝑅𝑎) → ¬ 𝑎𝑅𝑏))
7169, 70mpbi 221 . . . . . 6 ((𝜑𝑏𝑅𝑎) → ¬ 𝑎𝑅𝑏)
72 iffalse 4251 . . . . . . . 8 𝑎𝑅𝑏 → if(𝑎𝑅𝑏, 𝑎, 𝑏) = 𝑏)
7372fveq2d 6378 . . . . . . 7 𝑎𝑅𝑏 → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑃𝑏))
7472fveq2d 6378 . . . . . . 7 𝑎𝑅𝑏 → (𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑄𝑏))
7573, 74breq12d 4821 . . . . . 6 𝑎𝑅𝑏 → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑏)𝑆(𝑄𝑏)))
7671, 75syl 17 . . . . 5 ((𝜑𝑏𝑅𝑎) → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑏)𝑆(𝑄𝑏)))
7764, 76mpbird 248 . . . 4 ((𝜑𝑏𝑅𝑎) → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
78 solin 5220 . . . . 5 ((𝑅 Or 𝐴 ∧ (𝑎𝐴𝑏𝐴)) → (𝑎𝑅𝑏𝑎 = 𝑏𝑏𝑅𝑎))
7965, 1, 2, 78syl12anc 865 . . . 4 (𝜑 → (𝑎𝑅𝑏𝑎 = 𝑏𝑏𝑅𝑎))
8020, 54, 77, 79mpjao3dan 1556 . . 3 (𝜑 → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
81 r19.26 3210 . . . . 5 (∀𝑐𝐴 ((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) ↔ (∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))
8260, 11, 81sylanbrc 578 . . . 4 (𝜑 → ∀𝑐𝐴 ((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))
8365, 1, 23jca 1158 . . . . 5 (𝜑 → (𝑅 Or 𝐴𝑎𝐴𝑏𝐴))
84 prth 843 . . . . . . 7 (((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) → ((𝑐𝑅𝑎𝑐𝑅𝑏) → ((𝑃𝑐) = (𝑋𝑐) ∧ (𝑋𝑐) = (𝑄𝑐))))
85 eqtr 2783 . . . . . . 7 (((𝑃𝑐) = (𝑋𝑐) ∧ (𝑋𝑐) = (𝑄𝑐)) → (𝑃𝑐) = (𝑄𝑐))
8684, 85syl6 35 . . . . . 6 (((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) → ((𝑐𝑅𝑎𝑐𝑅𝑏) → (𝑃𝑐) = (𝑄𝑐)))
8786ralimi 3098 . . . . 5 (∀𝑐𝐴 ((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) → ∀𝑐𝐴 ((𝑐𝑅𝑎𝑐𝑅𝑏) → (𝑃𝑐) = (𝑄𝑐)))
88 simpl1 1242 . . . . . . . . 9 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → 𝑅 Or 𝐴)
89 simpr 477 . . . . . . . . 9 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → 𝑐𝐴)
90 simpl2 1244 . . . . . . . . 9 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → 𝑎𝐴)
91 simpl3 1246 . . . . . . . . 9 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → 𝑏𝐴)
92 soltmin 5714 . . . . . . . . 9 ((𝑅 Or 𝐴 ∧ (𝑐𝐴𝑎𝐴𝑏𝐴)) → (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) ↔ (𝑐𝑅𝑎𝑐𝑅𝑏)))
9388, 89, 90, 91, 92syl13anc 1491 . . . . . . . 8 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) ↔ (𝑐𝑅𝑎𝑐𝑅𝑏)))
9493biimpd 220 . . . . . . 7 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑐𝑅𝑎𝑐𝑅𝑏)))
9594imim1d 82 . . . . . 6 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → (((𝑐𝑅𝑎𝑐𝑅𝑏) → (𝑃𝑐) = (𝑄𝑐)) → (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐))))
9695ralimdva 3108 . . . . 5 ((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) → (∀𝑐𝐴 ((𝑐𝑅𝑎𝑐𝑅𝑏) → (𝑃𝑐) = (𝑄𝑐)) → ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐))))
9783, 87, 96syl2im 40 . . . 4 (𝜑 → (∀𝑐𝐴 ((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) → ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐))))
9882, 97mpd 15 . . 3 (𝜑 → ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐)))
99 fveq2 6374 . . . . . 6 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑑) = (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
100 fveq2 6374 . . . . . 6 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑄𝑑) = (𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
10199, 100breq12d 4821 . . . . 5 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → ((𝑃𝑑)𝑆(𝑄𝑑) ↔ (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏))))
102 breq2 4812 . . . . . . 7 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑐𝑅𝑑𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏)))
103102imbi1d 332 . . . . . 6 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → ((𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐)) ↔ (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐))))
104103ralbidv 3132 . . . . 5 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → (∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐)) ↔ ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐))))
105101, 104anbi12d 624 . . . 4 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → (((𝑃𝑑)𝑆(𝑄𝑑) ∧ ∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐))) ↔ ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ∧ ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐)))))
106105rspcev 3460 . . 3 ((if(𝑎𝑅𝑏, 𝑎, 𝑏) ∈ 𝐴 ∧ ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ∧ ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐)))) → ∃𝑑𝐴 ((𝑃𝑑)𝑆(𝑄𝑑) ∧ ∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐))))
1073, 80, 98, 106syl12anc 865 . 2 (𝜑 → ∃𝑑𝐴 ((𝑃𝑑)𝑆(𝑄𝑑) ∧ ∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐))))
108 wemapso.t . . . 4 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧)𝑆(𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))}
109108wemaplem1 8657 . . 3 ((𝑃 ∈ (𝐵𝑚 𝐴) ∧ 𝑄 ∈ (𝐵𝑚 𝐴)) → (𝑃𝑇𝑄 ↔ ∃𝑑𝐴 ((𝑃𝑑)𝑆(𝑄𝑑) ∧ ∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐)))))
11023, 31, 109syl2anc 579 . 2 (𝜑 → (𝑃𝑇𝑄 ↔ ∃𝑑𝐴 ((𝑃𝑑)𝑆(𝑄𝑑) ∧ ∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐)))))
111107, 110mpbird 248 1 (𝜑𝑃𝑇𝑄)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 197  wa 384  w3o 1106  w3a 1107   = wceq 1652  wcel 2155  wral 3054  wrex 3055  Vcvv 3349  ifcif 4242   class class class wbr 4808  {copab 4870   Po wpo 5195   Or wor 5196  wf 6063  cfv 6067  (class class class)co 6841  𝑚 cmap 8059
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2069  ax-7 2105  ax-8 2157  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2349  ax-ext 2742  ax-sep 4940  ax-nul 4948  ax-pow 5000  ax-pr 5061  ax-un 7146
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-3or 1108  df-3an 1109  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2062  df-mo 2564  df-eu 2581  df-clab 2751  df-cleq 2757  df-clel 2760  df-nfc 2895  df-ne 2937  df-ral 3059  df-rex 3060  df-rab 3063  df-v 3351  df-sbc 3596  df-csb 3691  df-dif 3734  df-un 3736  df-in 3738  df-ss 3745  df-nul 4079  df-if 4243  df-pw 4316  df-sn 4334  df-pr 4336  df-op 4340  df-uni 4594  df-iun 4677  df-br 4809  df-opab 4871  df-mpt 4888  df-id 5184  df-po 5197  df-so 5198  df-xp 5282  df-rel 5283  df-cnv 5284  df-co 5285  df-dm 5286  df-rn 5287  df-res 5288  df-ima 5289  df-iota 6030  df-fun 6069  df-fn 6070  df-f 6071  df-fv 6075  df-ov 6844  df-oprab 6845  df-mpt2 6846  df-1st 7365  df-2nd 7366  df-map 8061
This theorem is referenced by:  wemaplem3  8659
  Copyright terms: Public domain W3C validator