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

Theorem unocv 21660
Description: The orthocomplement of a union. (Contributed by Mario Carneiro, 23-Oct-2015.)
Hypothesis
Ref Expression
inocv.o = (ocv‘𝑊)
Assertion
Ref Expression
unocv ( ‘(𝐴𝐵)) = (( 𝐴) ∩ ( 𝐵))

Proof of Theorem unocv
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 unss 4130 . . . . . . 7 ((𝐴 ⊆ (Base‘𝑊) ∧ 𝐵 ⊆ (Base‘𝑊)) ↔ (𝐴𝐵) ⊆ (Base‘𝑊))
21bicomi 224 . . . . . 6 ((𝐴𝐵) ⊆ (Base‘𝑊) ↔ (𝐴 ⊆ (Base‘𝑊) ∧ 𝐵 ⊆ (Base‘𝑊)))
3 ralunb 4137 . . . . . 6 (∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)) ↔ (∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))
42, 3anbi12i 629 . . . . 5 (((𝐴𝐵) ⊆ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ↔ ((𝐴 ⊆ (Base‘𝑊) ∧ 𝐵 ⊆ (Base‘𝑊)) ∧ (∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
5 an4 657 . . . . 5 (((𝐴 ⊆ (Base‘𝑊) ∧ 𝐵 ⊆ (Base‘𝑊)) ∧ (∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))) ↔ ((𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
64, 5bitri 275 . . . 4 (((𝐴𝐵) ⊆ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ↔ ((𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
76anbi2i 624 . . 3 ((𝑧 ∈ (Base‘𝑊) ∧ ((𝐴𝐵) ⊆ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))) ↔ (𝑧 ∈ (Base‘𝑊) ∧ ((𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))))
8 eqid 2736 . . . . 5 (Base‘𝑊) = (Base‘𝑊)
9 eqid 2736 . . . . 5 (·𝑖𝑊) = (·𝑖𝑊)
10 eqid 2736 . . . . 5 (Scalar‘𝑊) = (Scalar‘𝑊)
11 eqid 2736 . . . . 5 (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
12 inocv.o . . . . 5 = (ocv‘𝑊)
138, 9, 10, 11, 12elocv 21648 . . . 4 (𝑧 ∈ ( ‘(𝐴𝐵)) ↔ ((𝐴𝐵) ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))
14 3anan12 1096 . . . 4 (((𝐴𝐵) ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ↔ (𝑧 ∈ (Base‘𝑊) ∧ ((𝐴𝐵) ⊆ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
1513, 14bitri 275 . . 3 (𝑧 ∈ ( ‘(𝐴𝐵)) ↔ (𝑧 ∈ (Base‘𝑊) ∧ ((𝐴𝐵) ⊆ (Base‘𝑊) ∧ ∀𝑦 ∈ (𝐴𝐵)(𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
168, 9, 10, 11, 12elocv 21648 . . . . . 6 (𝑧 ∈ ( 𝐴) ↔ (𝐴 ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))
17 3anan12 1096 . . . . . 6 ((𝐴 ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ↔ (𝑧 ∈ (Base‘𝑊) ∧ (𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
1816, 17bitri 275 . . . . 5 (𝑧 ∈ ( 𝐴) ↔ (𝑧 ∈ (Base‘𝑊) ∧ (𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
198, 9, 10, 11, 12elocv 21648 . . . . . 6 (𝑧 ∈ ( 𝐵) ↔ (𝐵 ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))
20 3anan12 1096 . . . . . 6 ((𝐵 ⊆ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ↔ (𝑧 ∈ (Base‘𝑊) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
2119, 20bitri 275 . . . . 5 (𝑧 ∈ ( 𝐵) ↔ (𝑧 ∈ (Base‘𝑊) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))))
2218, 21anbi12i 629 . . . 4 ((𝑧 ∈ ( 𝐴) ∧ 𝑧 ∈ ( 𝐵)) ↔ ((𝑧 ∈ (Base‘𝑊) ∧ (𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))) ∧ (𝑧 ∈ (Base‘𝑊) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))))
23 elin 3905 . . . 4 (𝑧 ∈ (( 𝐴) ∩ ( 𝐵)) ↔ (𝑧 ∈ ( 𝐴) ∧ 𝑧 ∈ ( 𝐵)))
24 anandi 677 . . . 4 ((𝑧 ∈ (Base‘𝑊) ∧ ((𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))) ↔ ((𝑧 ∈ (Base‘𝑊) ∧ (𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊)))) ∧ (𝑧 ∈ (Base‘𝑊) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))))
2522, 23, 243bitr4i 303 . . 3 (𝑧 ∈ (( 𝐴) ∩ ( 𝐵)) ↔ (𝑧 ∈ (Base‘𝑊) ∧ ((𝐴 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐴 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))) ∧ (𝐵 ⊆ (Base‘𝑊) ∧ ∀𝑦𝐵 (𝑧(·𝑖𝑊)𝑦) = (0g‘(Scalar‘𝑊))))))
267, 15, 253bitr4i 303 . 2 (𝑧 ∈ ( ‘(𝐴𝐵)) ↔ 𝑧 ∈ (( 𝐴) ∩ ( 𝐵)))
2726eqriv 2733 1 ( ‘(𝐴𝐵)) = (( 𝐴) ∩ ( 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3051  cun 3887  cin 3888  wss 3889  cfv 6498  (class class class)co 7367  Basecbs 17179  Scalarcsca 17223  ·𝑖cip 17225  0gc0g 17402  ocvcocv 21640
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fv 6506  df-ov 7370  df-ocv 21643
This theorem is referenced by:  cssincl  21668
  Copyright terms: Public domain W3C validator