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

Theorem wemaplem2 8412
Description: Lemma for wemapso 8416. 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 4109 . . 3 (𝜑 → if(𝑎𝑅𝑏, 𝑎, 𝑏) ∈ 𝐴)
4 wemaplem2.px2 . . . . . . 7 (𝜑 → (𝑃𝑎)𝑆(𝑋𝑎))
54adantr 481 . . . . . 6 ((𝜑𝑎𝑅𝑏) → (𝑃𝑎)𝑆(𝑋𝑎))
6 wemaplem2.xq3 . . . . . . . 8 (𝜑 → ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐)))
7 breq1 4626 . . . . . . . . . 10 (𝑐 = 𝑎 → (𝑐𝑅𝑏𝑎𝑅𝑏))
8 fveq2 6158 . . . . . . . . . . 11 (𝑐 = 𝑎 → (𝑋𝑐) = (𝑋𝑎))
9 fveq2 6158 . . . . . . . . . . 11 (𝑐 = 𝑎 → (𝑄𝑐) = (𝑄𝑎))
108, 9eqeq12d 2636 . . . . . . . . . 10 (𝑐 = 𝑎 → ((𝑋𝑐) = (𝑄𝑐) ↔ (𝑋𝑎) = (𝑄𝑎)))
117, 10imbi12d 334 . . . . . . . . 9 (𝑐 = 𝑎 → ((𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐)) ↔ (𝑎𝑅𝑏 → (𝑋𝑎) = (𝑄𝑎))))
1211rspcva 3297 . . . . . . . 8 ((𝑎𝐴 ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) → (𝑎𝑅𝑏 → (𝑋𝑎) = (𝑄𝑎)))
131, 6, 12syl2anc 692 . . . . . . 7 (𝜑 → (𝑎𝑅𝑏 → (𝑋𝑎) = (𝑄𝑎)))
1413imp 445 . . . . . 6 ((𝜑𝑎𝑅𝑏) → (𝑋𝑎) = (𝑄𝑎))
155, 14breqtrd 4649 . . . . 5 ((𝜑𝑎𝑅𝑏) → (𝑃𝑎)𝑆(𝑄𝑎))
16 iftrue 4070 . . . . . . . 8 (𝑎𝑅𝑏 → if(𝑎𝑅𝑏, 𝑎, 𝑏) = 𝑎)
1716fveq2d 6162 . . . . . . 7 (𝑎𝑅𝑏 → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑃𝑎))
1816fveq2d 6162 . . . . . . 7 (𝑎𝑅𝑏 → (𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑄𝑎))
1917, 18breq12d 4636 . . . . . 6 (𝑎𝑅𝑏 → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑎)𝑆(𝑄𝑎)))
2019adantl 482 . . . . 5 ((𝜑𝑎𝑅𝑏) → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑎)𝑆(𝑄𝑎)))
2115, 20mpbird 247 . . . 4 ((𝜑𝑎𝑅𝑏) → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
22 wemaplem2.s . . . . . . 7 (𝜑𝑆 Po 𝐵)
2322adantr 481 . . . . . 6 ((𝜑𝑎 = 𝑏) → 𝑆 Po 𝐵)
24 wemaplem2.p . . . . . . . . . 10 (𝜑𝑃 ∈ (𝐵𝑚 𝐴))
25 elmapi 7839 . . . . . . . . . 10 (𝑃 ∈ (𝐵𝑚 𝐴) → 𝑃:𝐴𝐵)
2624, 25syl 17 . . . . . . . . 9 (𝜑𝑃:𝐴𝐵)
2726, 2ffvelrnd 6326 . . . . . . . 8 (𝜑 → (𝑃𝑏) ∈ 𝐵)
28 wemaplem2.x . . . . . . . . . 10 (𝜑𝑋 ∈ (𝐵𝑚 𝐴))
29 elmapi 7839 . . . . . . . . . 10 (𝑋 ∈ (𝐵𝑚 𝐴) → 𝑋:𝐴𝐵)
3028, 29syl 17 . . . . . . . . 9 (𝜑𝑋:𝐴𝐵)
3130, 2ffvelrnd 6326 . . . . . . . 8 (𝜑 → (𝑋𝑏) ∈ 𝐵)
32 wemaplem2.q . . . . . . . . . 10 (𝜑𝑄 ∈ (𝐵𝑚 𝐴))
33 elmapi 7839 . . . . . . . . . 10 (𝑄 ∈ (𝐵𝑚 𝐴) → 𝑄:𝐴𝐵)
3432, 33syl 17 . . . . . . . . 9 (𝜑𝑄:𝐴𝐵)
3534, 2ffvelrnd 6326 . . . . . . . 8 (𝜑 → (𝑄𝑏) ∈ 𝐵)
3627, 31, 353jca 1240 . . . . . . 7 (𝜑 → ((𝑃𝑏) ∈ 𝐵 ∧ (𝑋𝑏) ∈ 𝐵 ∧ (𝑄𝑏) ∈ 𝐵))
3736adantr 481 . . . . . 6 ((𝜑𝑎 = 𝑏) → ((𝑃𝑏) ∈ 𝐵 ∧ (𝑋𝑏) ∈ 𝐵 ∧ (𝑄𝑏) ∈ 𝐵))
38 fveq2 6158 . . . . . . . . 9 (𝑎 = 𝑏 → (𝑃𝑎) = (𝑃𝑏))
39 fveq2 6158 . . . . . . . . 9 (𝑎 = 𝑏 → (𝑋𝑎) = (𝑋𝑏))
4038, 39breq12d 4636 . . . . . . . 8 (𝑎 = 𝑏 → ((𝑃𝑎)𝑆(𝑋𝑎) ↔ (𝑃𝑏)𝑆(𝑋𝑏)))
414, 40syl5ibcom 235 . . . . . . 7 (𝜑 → (𝑎 = 𝑏 → (𝑃𝑏)𝑆(𝑋𝑏)))
4241imp 445 . . . . . 6 ((𝜑𝑎 = 𝑏) → (𝑃𝑏)𝑆(𝑋𝑏))
43 wemaplem2.xq2 . . . . . . 7 (𝜑 → (𝑋𝑏)𝑆(𝑄𝑏))
4443adantr 481 . . . . . 6 ((𝜑𝑎 = 𝑏) → (𝑋𝑏)𝑆(𝑄𝑏))
45 potr 5017 . . . . . . 7 ((𝑆 Po 𝐵 ∧ ((𝑃𝑏) ∈ 𝐵 ∧ (𝑋𝑏) ∈ 𝐵 ∧ (𝑄𝑏) ∈ 𝐵)) → (((𝑃𝑏)𝑆(𝑋𝑏) ∧ (𝑋𝑏)𝑆(𝑄𝑏)) → (𝑃𝑏)𝑆(𝑄𝑏)))
4645imp 445 . . . . . 6 (((𝑆 Po 𝐵 ∧ ((𝑃𝑏) ∈ 𝐵 ∧ (𝑋𝑏) ∈ 𝐵 ∧ (𝑄𝑏) ∈ 𝐵)) ∧ ((𝑃𝑏)𝑆(𝑋𝑏) ∧ (𝑋𝑏)𝑆(𝑄𝑏))) → (𝑃𝑏)𝑆(𝑄𝑏))
4723, 37, 42, 44, 46syl22anc 1324 . . . . 5 ((𝜑𝑎 = 𝑏) → (𝑃𝑏)𝑆(𝑄𝑏))
48 ifeq1 4068 . . . . . . . . 9 (𝑎 = 𝑏 → if(𝑎𝑅𝑏, 𝑎, 𝑏) = if(𝑎𝑅𝑏, 𝑏, 𝑏))
49 ifid 4103 . . . . . . . . 9 if(𝑎𝑅𝑏, 𝑏, 𝑏) = 𝑏
5048, 49syl6eq 2671 . . . . . . . 8 (𝑎 = 𝑏 → if(𝑎𝑅𝑏, 𝑎, 𝑏) = 𝑏)
5150fveq2d 6162 . . . . . . 7 (𝑎 = 𝑏 → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑃𝑏))
5250fveq2d 6162 . . . . . . 7 (𝑎 = 𝑏 → (𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑄𝑏))
5351, 52breq12d 4636 . . . . . 6 (𝑎 = 𝑏 → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑏)𝑆(𝑄𝑏)))
5453adantl 482 . . . . 5 ((𝜑𝑎 = 𝑏) → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑏)𝑆(𝑄𝑏)))
5547, 54mpbird 247 . . . 4 ((𝜑𝑎 = 𝑏) → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
56 wemaplem2.px3 . . . . . . . 8 (𝜑 → ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)))
57 breq1 4626 . . . . . . . . . 10 (𝑐 = 𝑏 → (𝑐𝑅𝑎𝑏𝑅𝑎))
58 fveq2 6158 . . . . . . . . . . 11 (𝑐 = 𝑏 → (𝑃𝑐) = (𝑃𝑏))
59 fveq2 6158 . . . . . . . . . . 11 (𝑐 = 𝑏 → (𝑋𝑐) = (𝑋𝑏))
6058, 59eqeq12d 2636 . . . . . . . . . 10 (𝑐 = 𝑏 → ((𝑃𝑐) = (𝑋𝑐) ↔ (𝑃𝑏) = (𝑋𝑏)))
6157, 60imbi12d 334 . . . . . . . . 9 (𝑐 = 𝑏 → ((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ↔ (𝑏𝑅𝑎 → (𝑃𝑏) = (𝑋𝑏))))
6261rspcva 3297 . . . . . . . 8 ((𝑏𝐴 ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))) → (𝑏𝑅𝑎 → (𝑃𝑏) = (𝑋𝑏)))
632, 56, 62syl2anc 692 . . . . . . 7 (𝜑 → (𝑏𝑅𝑎 → (𝑃𝑏) = (𝑋𝑏)))
6463imp 445 . . . . . 6 ((𝜑𝑏𝑅𝑎) → (𝑃𝑏) = (𝑋𝑏))
6543adantr 481 . . . . . 6 ((𝜑𝑏𝑅𝑎) → (𝑋𝑏)𝑆(𝑄𝑏))
6664, 65eqbrtrd 4645 . . . . 5 ((𝜑𝑏𝑅𝑎) → (𝑃𝑏)𝑆(𝑄𝑏))
67 wemaplem2.r . . . . . . . . 9 (𝜑𝑅 Or 𝐴)
68 sopo 5022 . . . . . . . . 9 (𝑅 Or 𝐴𝑅 Po 𝐴)
6967, 68syl 17 . . . . . . . 8 (𝜑𝑅 Po 𝐴)
70 po2nr 5018 . . . . . . . 8 ((𝑅 Po 𝐴 ∧ (𝑏𝐴𝑎𝐴)) → ¬ (𝑏𝑅𝑎𝑎𝑅𝑏))
7169, 2, 1, 70syl12anc 1321 . . . . . . 7 (𝜑 → ¬ (𝑏𝑅𝑎𝑎𝑅𝑏))
72 nan 603 . . . . . . 7 ((𝜑 → ¬ (𝑏𝑅𝑎𝑎𝑅𝑏)) ↔ ((𝜑𝑏𝑅𝑎) → ¬ 𝑎𝑅𝑏))
7371, 72mpbi 220 . . . . . 6 ((𝜑𝑏𝑅𝑎) → ¬ 𝑎𝑅𝑏)
74 iffalse 4073 . . . . . . . 8 𝑎𝑅𝑏 → if(𝑎𝑅𝑏, 𝑎, 𝑏) = 𝑏)
7574fveq2d 6162 . . . . . . 7 𝑎𝑅𝑏 → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑃𝑏))
7674fveq2d 6162 . . . . . . 7 𝑎𝑅𝑏 → (𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) = (𝑄𝑏))
7775, 76breq12d 4636 . . . . . 6 𝑎𝑅𝑏 → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑏)𝑆(𝑄𝑏)))
7873, 77syl 17 . . . . 5 ((𝜑𝑏𝑅𝑎) → ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ↔ (𝑃𝑏)𝑆(𝑄𝑏)))
7966, 78mpbird 247 . . . 4 ((𝜑𝑏𝑅𝑎) → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
80 solin 5028 . . . . 5 ((𝑅 Or 𝐴 ∧ (𝑎𝐴𝑏𝐴)) → (𝑎𝑅𝑏𝑎 = 𝑏𝑏𝑅𝑎))
8167, 1, 2, 80syl12anc 1321 . . . 4 (𝜑 → (𝑎𝑅𝑏𝑎 = 𝑏𝑏𝑅𝑎))
8221, 55, 79, 81mpjao3dan 1392 . . 3 (𝜑 → (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
83 r19.26 3059 . . . . 5 (∀𝑐𝐴 ((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) ↔ (∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))
8456, 6, 83sylanbrc 697 . . . 4 (𝜑 → ∀𝑐𝐴 ((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))
8567, 1, 23jca 1240 . . . . 5 (𝜑 → (𝑅 Or 𝐴𝑎𝐴𝑏𝐴))
86 prth 594 . . . . . . 7 (((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) → ((𝑐𝑅𝑎𝑐𝑅𝑏) → ((𝑃𝑐) = (𝑋𝑐) ∧ (𝑋𝑐) = (𝑄𝑐))))
87 eqtr 2640 . . . . . . 7 (((𝑃𝑐) = (𝑋𝑐) ∧ (𝑋𝑐) = (𝑄𝑐)) → (𝑃𝑐) = (𝑄𝑐))
8886, 87syl6 35 . . . . . 6 (((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) → ((𝑐𝑅𝑎𝑐𝑅𝑏) → (𝑃𝑐) = (𝑄𝑐)))
8988ralimi 2948 . . . . 5 (∀𝑐𝐴 ((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) → ∀𝑐𝐴 ((𝑐𝑅𝑎𝑐𝑅𝑏) → (𝑃𝑐) = (𝑄𝑐)))
90 simpl1 1062 . . . . . . . . 9 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → 𝑅 Or 𝐴)
91 simpr 477 . . . . . . . . 9 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → 𝑐𝐴)
92 simpl2 1063 . . . . . . . . 9 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → 𝑎𝐴)
93 simpl3 1064 . . . . . . . . 9 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → 𝑏𝐴)
94 soltmin 5501 . . . . . . . . 9 ((𝑅 Or 𝐴 ∧ (𝑐𝐴𝑎𝐴𝑏𝐴)) → (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) ↔ (𝑐𝑅𝑎𝑐𝑅𝑏)))
9590, 91, 92, 93, 94syl13anc 1325 . . . . . . . 8 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) ↔ (𝑐𝑅𝑎𝑐𝑅𝑏)))
9695biimpd 219 . . . . . . 7 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑐𝑅𝑎𝑐𝑅𝑏)))
9796imim1d 82 . . . . . 6 (((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) ∧ 𝑐𝐴) → (((𝑐𝑅𝑎𝑐𝑅𝑏) → (𝑃𝑐) = (𝑄𝑐)) → (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐))))
9897ralimdva 2958 . . . . 5 ((𝑅 Or 𝐴𝑎𝐴𝑏𝐴) → (∀𝑐𝐴 ((𝑐𝑅𝑎𝑐𝑅𝑏) → (𝑃𝑐) = (𝑄𝑐)) → ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐))))
9985, 89, 98syl2im 40 . . . 4 (𝜑 → (∀𝑐𝐴 ((𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)) ∧ (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) → ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐))))
10084, 99mpd 15 . . 3 (𝜑 → ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐)))
101 fveq2 6158 . . . . . 6 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑑) = (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
102 fveq2 6158 . . . . . 6 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑄𝑑) = (𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)))
103101, 102breq12d 4636 . . . . 5 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → ((𝑃𝑑)𝑆(𝑄𝑑) ↔ (𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏))))
104 breq2 4627 . . . . . . 7 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑐𝑅𝑑𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏)))
105104imbi1d 331 . . . . . 6 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → ((𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐)) ↔ (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐))))
106105ralbidv 2982 . . . . 5 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → (∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐)) ↔ ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐))))
107103, 106anbi12d 746 . . . 4 (𝑑 = if(𝑎𝑅𝑏, 𝑎, 𝑏) → (((𝑃𝑑)𝑆(𝑄𝑑) ∧ ∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐))) ↔ ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ∧ ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐)))))
108107rspcev 3299 . . 3 ((if(𝑎𝑅𝑏, 𝑎, 𝑏) ∈ 𝐴 ∧ ((𝑃‘if(𝑎𝑅𝑏, 𝑎, 𝑏))𝑆(𝑄‘if(𝑎𝑅𝑏, 𝑎, 𝑏)) ∧ ∀𝑐𝐴 (𝑐𝑅if(𝑎𝑅𝑏, 𝑎, 𝑏) → (𝑃𝑐) = (𝑄𝑐)))) → ∃𝑑𝐴 ((𝑃𝑑)𝑆(𝑄𝑑) ∧ ∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐))))
1093, 82, 100, 108syl12anc 1321 . 2 (𝜑 → ∃𝑑𝐴 ((𝑃𝑑)𝑆(𝑄𝑑) ∧ ∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐))))
110 wemapso.t . . . 4 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧)𝑆(𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))}
111110wemaplem1 8411 . . 3 ((𝑃 ∈ (𝐵𝑚 𝐴) ∧ 𝑄 ∈ (𝐵𝑚 𝐴)) → (𝑃𝑇𝑄 ↔ ∃𝑑𝐴 ((𝑃𝑑)𝑆(𝑄𝑑) ∧ ∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐)))))
11224, 32, 111syl2anc 692 . 2 (𝜑 → (𝑃𝑇𝑄 ↔ ∃𝑑𝐴 ((𝑃𝑑)𝑆(𝑄𝑑) ∧ ∀𝑐𝐴 (𝑐𝑅𝑑 → (𝑃𝑐) = (𝑄𝑐)))))
113109, 112mpbird 247 1 (𝜑𝑃𝑇𝑄)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384  w3o 1035  w3a 1036   = wceq 1480  wcel 1987  wral 2908  wrex 2909  Vcvv 3190  ifcif 4064   class class class wbr 4623  {copab 4682   Po wpo 5003   Or wor 5004  wf 5853  cfv 5857  (class class class)co 6615  𝑚 cmap 7817
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-rab 2917  df-v 3192  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-iun 4494  df-br 4624  df-opab 4684  df-mpt 4685  df-id 4999  df-po 5005  df-so 5006  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-fv 5865  df-ov 6618  df-oprab 6619  df-mpt2 6620  df-1st 7128  df-2nd 7129  df-map 7819
This theorem is referenced by:  wemaplem3  8413
  Copyright terms: Public domain W3C validator