Users' Mathboxes Mathbox for Jeff Hankins < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isfne Structured version   Visualization version   GIF version

Theorem isfne 35224
Description: The predicate "𝐵 is finer than 𝐴". This property is, in a sense, the opposite of refinement, as refinement requires every element to be a subset of an element of the original and fineness requires that every element of the original have a subset in the finer cover containing every point. I do not know of a literature reference for this. (Contributed by Jeff Hankins, 28-Sep-2009.)
Hypotheses
Ref Expression
isfne.1 𝑋 = 𝐴
isfne.2 𝑌 = 𝐵
Assertion
Ref Expression
isfne (𝐵𝐶 → (𝐴Fne𝐵 ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝐴 𝑥 (𝐵 ∩ 𝒫 𝑥))))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶
Allowed substitution hints:   𝑋(𝑥)   𝑌(𝑥)

Proof of Theorem isfne
Dummy variables 𝑠 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fnerel 35223 . . . . 5 Rel Fne
21brrelex1i 5733 . . . 4 (𝐴Fne𝐵𝐴 ∈ V)
32anim1i 616 . . 3 ((𝐴Fne𝐵𝐵𝐶) → (𝐴 ∈ V ∧ 𝐵𝐶))
43ancoms 460 . 2 ((𝐵𝐶𝐴Fne𝐵) → (𝐴 ∈ V ∧ 𝐵𝐶))
5 simpr 486 . . . . 5 ((𝐵𝐶𝑋 = 𝑌) → 𝑋 = 𝑌)
6 isfne.1 . . . . 5 𝑋 = 𝐴
7 isfne.2 . . . . 5 𝑌 = 𝐵
85, 6, 73eqtr3g 2796 . . . 4 ((𝐵𝐶𝑋 = 𝑌) → 𝐴 = 𝐵)
9 simpr 486 . . . . . . 7 ((𝐵𝐶 𝐴 = 𝐵) → 𝐴 = 𝐵)
10 uniexg 7730 . . . . . . . 8 (𝐵𝐶 𝐵 ∈ V)
1110adantr 482 . . . . . . 7 ((𝐵𝐶 𝐴 = 𝐵) → 𝐵 ∈ V)
129, 11eqeltrd 2834 . . . . . 6 ((𝐵𝐶 𝐴 = 𝐵) → 𝐴 ∈ V)
13 uniexb 7751 . . . . . 6 (𝐴 ∈ V ↔ 𝐴 ∈ V)
1412, 13sylibr 233 . . . . 5 ((𝐵𝐶 𝐴 = 𝐵) → 𝐴 ∈ V)
15 simpl 484 . . . . 5 ((𝐵𝐶 𝐴 = 𝐵) → 𝐵𝐶)
1614, 15jca 513 . . . 4 ((𝐵𝐶 𝐴 = 𝐵) → (𝐴 ∈ V ∧ 𝐵𝐶))
178, 16syldan 592 . . 3 ((𝐵𝐶𝑋 = 𝑌) → (𝐴 ∈ V ∧ 𝐵𝐶))
1817adantrr 716 . 2 ((𝐵𝐶 ∧ (𝑋 = 𝑌 ∧ ∀𝑥𝐴 𝑥 (𝐵 ∩ 𝒫 𝑥))) → (𝐴 ∈ V ∧ 𝐵𝐶))
19 unieq 4920 . . . . . 6 (𝑟 = 𝐴 𝑟 = 𝐴)
2019, 6eqtr4di 2791 . . . . 5 (𝑟 = 𝐴 𝑟 = 𝑋)
2120eqeq1d 2735 . . . 4 (𝑟 = 𝐴 → ( 𝑟 = 𝑠𝑋 = 𝑠))
22 raleq 3323 . . . 4 (𝑟 = 𝐴 → (∀𝑥𝑟 𝑥 (𝑠 ∩ 𝒫 𝑥) ↔ ∀𝑥𝐴 𝑥 (𝑠 ∩ 𝒫 𝑥)))
2321, 22anbi12d 632 . . 3 (𝑟 = 𝐴 → (( 𝑟 = 𝑠 ∧ ∀𝑥𝑟 𝑥 (𝑠 ∩ 𝒫 𝑥)) ↔ (𝑋 = 𝑠 ∧ ∀𝑥𝐴 𝑥 (𝑠 ∩ 𝒫 𝑥))))
24 unieq 4920 . . . . . 6 (𝑠 = 𝐵 𝑠 = 𝐵)
2524, 7eqtr4di 2791 . . . . 5 (𝑠 = 𝐵 𝑠 = 𝑌)
2625eqeq2d 2744 . . . 4 (𝑠 = 𝐵 → (𝑋 = 𝑠𝑋 = 𝑌))
27 ineq1 4206 . . . . . . 7 (𝑠 = 𝐵 → (𝑠 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑥))
2827unieqd 4923 . . . . . 6 (𝑠 = 𝐵 (𝑠 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑥))
2928sseq2d 4015 . . . . 5 (𝑠 = 𝐵 → (𝑥 (𝑠 ∩ 𝒫 𝑥) ↔ 𝑥 (𝐵 ∩ 𝒫 𝑥)))
3029ralbidv 3178 . . . 4 (𝑠 = 𝐵 → (∀𝑥𝐴 𝑥 (𝑠 ∩ 𝒫 𝑥) ↔ ∀𝑥𝐴 𝑥 (𝐵 ∩ 𝒫 𝑥)))
3126, 30anbi12d 632 . . 3 (𝑠 = 𝐵 → ((𝑋 = 𝑠 ∧ ∀𝑥𝐴 𝑥 (𝑠 ∩ 𝒫 𝑥)) ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝐴 𝑥 (𝐵 ∩ 𝒫 𝑥))))
32 df-fne 35222 . . 3 Fne = {⟨𝑟, 𝑠⟩ ∣ ( 𝑟 = 𝑠 ∧ ∀𝑥𝑟 𝑥 (𝑠 ∩ 𝒫 𝑥))}
3323, 31, 32brabg 5540 . 2 ((𝐴 ∈ V ∧ 𝐵𝐶) → (𝐴Fne𝐵 ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝐴 𝑥 (𝐵 ∩ 𝒫 𝑥))))
344, 18, 33pm5.21nd 801 1 (𝐵𝐶 → (𝐴Fne𝐵 ↔ (𝑋 = 𝑌 ∧ ∀𝑥𝐴 𝑥 (𝐵 ∩ 𝒫 𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397   = wceq 1542  wcel 2107  wral 3062  Vcvv 3475  cin 3948  wss 3949  𝒫 cpw 4603   cuni 4909   class class class wbr 5149  Fnecfne 35221
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-xp 5683  df-rel 5684  df-fne 35222
This theorem is referenced by:  isfne4  35225
  Copyright terms: Public domain W3C validator