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

Theorem bropfvvvvlem 8088
Description: Lemma for bropfvvvv 8089. (Contributed by AV, 31-Dec-2020.) (Revised by AV, 16-Jan-2021.)
Hypotheses
Ref Expression
bropfvvvv.o 𝑂 = (𝑎𝑈 ↦ (𝑏𝑉, 𝑐𝑊 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜑}))
bropfvvvv.oo ((𝐴𝑈𝐵𝑆𝐶𝑇) → (𝐵(𝑂𝐴)𝐶) = {⟨𝑑, 𝑒⟩ ∣ 𝜃})
Assertion
Ref Expression
bropfvvvvlem ((⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑇) ∧ 𝐷(𝐵(𝑂𝐴)𝐶)𝐸) → (𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))
Distinct variable group:   𝑈,𝑎
Allowed substitution hints:   𝜑(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)   𝜃(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)   𝐴(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)   𝐵(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)   𝐶(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)   𝐷(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)   𝑆(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)   𝑇(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)   𝑈(𝑒, 𝑏, 𝑐, 𝑑)   𝐸(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)   𝑂(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)   𝑉(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)   𝑊(𝑒, 𝑎, 𝑏, 𝑐, 𝑑)

Proof of Theorem bropfvvvvlem
StepHypRef Expression
1 opelxp 5691 . . 3 (⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑇) ↔ (𝐵𝑆𝐶𝑇))
2 brne0 5155 . . . . . . 7 (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐵(𝑂𝐴)𝐶) ≠ ∅)
3 bropfvvvv.oo . . . . . . . . . . . . . 14 ((𝐴𝑈𝐵𝑆𝐶𝑇) → (𝐵(𝑂𝐴)𝐶) = {⟨𝑑, 𝑒⟩ ∣ 𝜃})
433expb 1138 . . . . . . . . . . . . 13 ((𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇)) → (𝐵(𝑂𝐴)𝐶) = {⟨𝑑, 𝑒⟩ ∣ 𝜃})
54breqd 5114 . . . . . . . . . . . 12 ((𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇)) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸𝐷{⟨𝑑, 𝑒⟩ ∣ 𝜃}𝐸))
6 brabv 5545 . . . . . . . . . . . . . . 15 (𝐷{⟨𝑑, 𝑒⟩ ∣ 𝜃}𝐸 → (𝐷 ∈ V ∧ 𝐸 ∈ V))
76anim2i 629 . . . . . . . . . . . . . 14 ((𝐴𝑈𝐷{⟨𝑑, 𝑒⟩ ∣ 𝜃}𝐸) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))
87ex 418 . . . . . . . . . . . . 13 (𝐴𝑈 → (𝐷{⟨𝑑, 𝑒⟩ ∣ 𝜃}𝐸 → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
98adantr 486 . . . . . . . . . . . 12 ((𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇)) → (𝐷{⟨𝑑, 𝑒⟩ ∣ 𝜃}𝐸 → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
105, 9sylbid 243 . . . . . . . . . . 11 ((𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇)) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
1110ex 418 . . . . . . . . . 10 (𝐴𝑈 → ((𝐵𝑆𝐶𝑇) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))
1211com23 87 . . . . . . . . 9 (𝐴𝑈 → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))
1312a1d 26 . . . . . . . 8 (𝐴𝑈 → ((𝐵(𝑂𝐴)𝐶) ≠ ∅ → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
14 bropfvvvv.o . . . . . . . . . 10 𝑂 = (𝑎𝑈 ↦ (𝑏𝑉, 𝑐𝑊 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜑}))
1514fvmptndm 7018 . . . . . . . . 9 𝐴𝑈 → (𝑂𝐴) = ∅)
16 df-ov 7416 . . . . . . . . . . 11 (𝐵(𝑂𝐴)𝐶) = ((𝑂𝐴)‘⟨𝐵, 𝐶⟩)
17 fveq1 6877 . . . . . . . . . . 11 ((𝑂𝐴) = ∅ → ((𝑂𝐴)‘⟨𝐵, 𝐶⟩) = (∅‘⟨𝐵, 𝐶⟩))
1816, 17eqtrid 2807 . . . . . . . . . 10 ((𝑂𝐴) = ∅ → (𝐵(𝑂𝐴)𝐶) = (∅‘⟨𝐵, 𝐶⟩))
19 0fv 6919 . . . . . . . . . 10 (∅‘⟨𝐵, 𝐶⟩) = ∅
2018, 19eqtrdi 2811 . . . . . . . . 9 ((𝑂𝐴) = ∅ → (𝐵(𝑂𝐴)𝐶) = ∅)
21 eqneqall 2966 . . . . . . . . 9 ((𝐵(𝑂𝐴)𝐶) = ∅ → ((𝐵(𝑂𝐴)𝐶) ≠ ∅ → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
2215, 20, 213syl 19 . . . . . . . 8 𝐴𝑈 → ((𝐵(𝑂𝐴)𝐶) ≠ ∅ → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
2313, 22pm2.61i 184 . . . . . . 7 ((𝐵(𝑂𝐴)𝐶) ≠ ∅ → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))
242, 23mpcom 39 . . . . . 6 (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐵𝑆𝐶𝑇) → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
2524com12 33 . . . . 5 ((𝐵𝑆𝐶𝑇) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
2625anc2ri 566 . . . 4 ((𝐵𝑆𝐶𝑇) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → ((𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)) ∧ (𝐵𝑆𝐶𝑇))))
27 3anan32 1113 . . . 4 ((𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)) ↔ ((𝐴𝑈 ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)) ∧ (𝐵𝑆𝐶𝑇)))
2826, 27imbitrrdi 255 . . 3 ((𝐵𝑆𝐶𝑇) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
291, 28sylbi 220 . 2 (⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑇) → (𝐷(𝐵(𝑂𝐴)𝐶)𝐸 → (𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
3029imp 412 1 ((⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑇) ∧ 𝐷(𝐵(𝑂𝐴)𝐶)𝐸) → (𝐴𝑈 ∧ (𝐵𝑆𝐶𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  wne 2955  Vcvv 3450  c0 4279  cop 4590   class class class wbr 5103  {copab 5167  cmpt 5186   × cxp 5653  cfv 6533  (class class class)co 7413  cmpo 7415
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-xp 5661  df-dm 5665  df-iota 6489  df-fv 6541  df-ov 7416
This theorem is used by:  bropfvvvv  8089
  Copyright terms: Public domain W3C validator